./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:36:00,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:36:00,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:36:00,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:36:00,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:36:00,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:36:00,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:36:00,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:36:00,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:36:00,844 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:36:00,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:36:00,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:36:00,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:36:00,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:36:00,851 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:36:00,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:36:00,853 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:36:00,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:36:00,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:36:00,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:36:00,854 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:36:00,855 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:36:00,855 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:36:00,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:36:00,855 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:36:00,856 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:36:00,856 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:36:00,856 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:36:00,856 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:36:00,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:36:00,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:36:00,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:36:00,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:36:00,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:36:00,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:36:00,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:36:00,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:36:00,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:36:00,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:36:00,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:36:00,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:36:00,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:36:00,860 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2024-11-17 00:36:01,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:36:01,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:36:01,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:36:01,157 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:36:01,158 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:36:01,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2024-11-17 00:36:02,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:36:02,871 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:36:02,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2024-11-17 00:36:02,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc931524/641a1655092a4e87a884c4b8891fd9a6/FLAG216326d0d [2024-11-17 00:36:03,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc931524/641a1655092a4e87a884c4b8891fd9a6 [2024-11-17 00:36:03,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:36:03,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:36:03,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:36:03,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:36:03,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:36:03,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:36:03" (1/1) ... [2024-11-17 00:36:03,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35015c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:03, skipping insertion in model container [2024-11-17 00:36:03,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:36:03" (1/1) ... [2024-11-17 00:36:03,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:36:03,551 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:36:03,650 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:36:03,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:36:03,682 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-17 00:36:03,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1c163ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:03, skipping insertion in model container [2024-11-17 00:36:03,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:36:03,685 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 00:36:03,686 INFO L158 Benchmark]: Toolchain (without parser) took 531.23ms. Allocated memory is still 161.5MB. Free memory was 129.8MB in the beginning and 112.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 00:36:03,688 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory was 131.5MB in the beginning and 131.3MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:36:03,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.10ms. Allocated memory is still 161.5MB. Free memory was 129.8MB in the beginning and 112.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 00:36:03,690 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory was 131.5MB in the beginning and 131.3MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.10ms. Allocated memory is still 161.5MB. Free memory was 129.8MB in the beginning and 112.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:36:05,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:36:05,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 00:36:05,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:36:05,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:36:05,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:36:05,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:36:05,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:36:05,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:36:05,847 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:36:05,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:36:05,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:36:05,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:36:05,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:36:05,852 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:36:05,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:36:05,852 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:36:05,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:36:05,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:36:05,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:36:05,853 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:36:05,853 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:36:05,854 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:36:05,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:36:05,855 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:36:05,855 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:36:05,855 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:36:05,856 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:36:05,856 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:36:05,856 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:36:05,856 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:36:05,856 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:36:05,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:36:05,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:36:05,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:36:05,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:36:05,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:36:05,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:36:05,858 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:36:05,858 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:36:05,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:36:05,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:36:05,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:36:05,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:36:05,860 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2024-11-17 00:36:06,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:36:06,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:36:06,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:36:06,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:36:06,198 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:36:06,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2024-11-17 00:36:07,745 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:36:08,014 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:36:08,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2024-11-17 00:36:08,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3099d1e/688b7e03ed5a47fcb2fb4c7c87cbea9f/FLAGf746474f8 [2024-11-17 00:36:08,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3099d1e/688b7e03ed5a47fcb2fb4c7c87cbea9f [2024-11-17 00:36:08,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:36:08,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:36:08,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:36:08,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:36:08,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:36:08,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ccc1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08, skipping insertion in model container [2024-11-17 00:36:08,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:36:08,462 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:36:08,554 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:36:08,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:36:08,591 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 00:36:08,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:36:08,635 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:36:08,674 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:36:08,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:36:08,690 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:36:08,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:36:08,783 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:36:08,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08 WrapperNode [2024-11-17 00:36:08,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:36:08,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:36:08,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:36:08,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:36:08,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,862 INFO L138 Inliner]: procedures = 175, calls = 119, calls flagged for inlining = 30, calls inlined = 15, statements flattened = 199 [2024-11-17 00:36:08,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:36:08,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:36:08,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:36:08,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:36:08,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,919 INFO L175 MemorySlicer]: Split 36 memory accesses to 3 slices as follows [2, 5, 29]. 81 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2]. The 17 writes are split as follows [0, 4, 13]. [2024-11-17 00:36:08,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:36:08,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:36:08,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:36:08,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:36:08,952 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08" (1/1) ... [2024-11-17 00:36:08,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:36:08,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:36:08,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:36:09,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:36:09,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 00:36:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 00:36:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 00:36:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-17 00:36:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-17 00:36:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-17 00:36:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-17 00:36:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-17 00:36:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-17 00:36:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:36:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:36:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2024-11-17 00:36:09,052 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2024-11-17 00:36:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:36:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:36:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:36:09,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:36:09,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:36:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:36:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:36:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 00:36:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 00:36:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 00:36:09,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:36:09,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 00:36:09,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 00:36:09,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-17 00:36:09,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-17 00:36:09,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-17 00:36:09,056 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-11-17 00:36:09,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-11-17 00:36:09,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:36:09,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:36:09,248 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:36:09,250 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:36:09,553 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2024-11-17 00:36:09,565 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L533: havoc #t~malloc13#1.base, #t~malloc13#1.offset; [2024-11-17 00:36:09,971 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L813: call ULTIMATE.dealloc(hid_open_report_~#item~0#1.base, hid_open_report_~#item~0#1.offset);havoc hid_open_report_~#item~0#1.base, hid_open_report_~#item~0#1.offset; [2024-11-17 00:36:10,029 INFO L? ?]: Removed 245 outVars from TransFormulas that were not future-live. [2024-11-17 00:36:10,029 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:36:10,053 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:36:10,055 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:36:10,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:36:10 BoogieIcfgContainer [2024-11-17 00:36:10,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:36:10,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:36:10,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:36:10,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:36:10,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:36:08" (1/3) ... [2024-11-17 00:36:10,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16596b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:36:10, skipping insertion in model container [2024-11-17 00:36:10,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:36:08" (2/3) ... [2024-11-17 00:36:10,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16596b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:36:10, skipping insertion in model container [2024-11-17 00:36:10,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:36:10" (3/3) ... [2024-11-17 00:36:10,063 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test23_2.i [2024-11-17 00:36:10,076 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:36:10,076 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 79 error locations. [2024-11-17 00:36:10,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:36:10,145 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;@1cbade96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:36:10,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2024-11-17 00:36:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 121 states have (on average 1.7685950413223142) internal successors, (214), 200 states have internal predecessors, (214), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 00:36:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:36:10,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:10,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:10,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:10,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1802640384, now seen corresponding path program 1 times [2024-11-17 00:36:10,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:10,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709576934] [2024-11-17 00:36:10,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:10,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:10,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:10,185 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:10,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 00:36:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:10,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:36:10,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:10,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 00:36:10,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-11-17 00:36:10,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:10,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:10,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709576934] [2024-11-17 00:36:10,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709576934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:10,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:10,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:36:10,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165372343] [2024-11-17 00:36:10,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:10,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:36:10,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:10,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:36:10,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:36:10,466 INFO L87 Difference]: Start difference. First operand has 215 states, 121 states have (on average 1.7685950413223142) internal successors, (214), 200 states have internal predecessors, (214), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:36:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:11,269 INFO L93 Difference]: Finished difference Result 231 states and 246 transitions. [2024-11-17 00:36:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:36:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-17 00:36:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:11,283 INFO L225 Difference]: With dead ends: 231 [2024-11-17 00:36:11,283 INFO L226 Difference]: Without dead ends: 228 [2024-11-17 00:36:11,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:36:11,288 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 10 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:11,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 872 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 00:36:11,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-17 00:36:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 221. [2024-11-17 00:36:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 126 states have (on average 1.7301587301587302) internal successors, (218), 204 states have internal predecessors, (218), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-17 00:36:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 237 transitions. [2024-11-17 00:36:11,336 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 237 transitions. Word has length 12 [2024-11-17 00:36:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:11,336 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 237 transitions. [2024-11-17 00:36:11,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:36:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 237 transitions. [2024-11-17 00:36:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:36:11,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:11,338 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:11,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-17 00:36:11,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:11,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:11,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1802640383, now seen corresponding path program 1 times [2024-11-17 00:36:11,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:11,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053357323] [2024-11-17 00:36:11,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:11,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:11,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:11,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:11,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 00:36:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:11,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 00:36:11,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:11,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:36:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:11,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:11,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053357323] [2024-11-17 00:36:11,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053357323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:11,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:11,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:36:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405864114] [2024-11-17 00:36:11,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:11,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:36:11,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:11,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:36:11,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:36:11,798 INFO L87 Difference]: Start difference. First operand 221 states and 237 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:36:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:12,478 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2024-11-17 00:36:12,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:36:12,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-17 00:36:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:12,481 INFO L225 Difference]: With dead ends: 225 [2024-11-17 00:36:12,481 INFO L226 Difference]: Without dead ends: 225 [2024-11-17 00:36:12,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:36:12,482 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 10 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:12,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1167 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:36:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-17 00:36:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 221. [2024-11-17 00:36:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 204 states have internal predecessors, (216), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-17 00:36:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 235 transitions. [2024-11-17 00:36:12,495 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 235 transitions. Word has length 12 [2024-11-17 00:36:12,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:12,496 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 235 transitions. [2024-11-17 00:36:12,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:36:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 235 transitions. [2024-11-17 00:36:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:36:12,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:12,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:12,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 00:36:12,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:12,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:12,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:12,700 INFO L85 PathProgramCache]: Analyzing trace with hash -59830049, now seen corresponding path program 1 times [2024-11-17 00:36:12,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:12,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339579851] [2024-11-17 00:36:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:12,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:12,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:12,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:12,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 00:36:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:12,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:36:12,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:12,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:12,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:12,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339579851] [2024-11-17 00:36:12,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339579851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:12,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:12,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:36:12,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203343734] [2024-11-17 00:36:12,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:12,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:36:12,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:12,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:36:12,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:36:12,844 INFO L87 Difference]: Start difference. First operand 221 states and 235 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:36:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:12,881 INFO L93 Difference]: Finished difference Result 212 states and 225 transitions. [2024-11-17 00:36:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:36:12,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-17 00:36:12,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:12,886 INFO L225 Difference]: With dead ends: 212 [2024-11-17 00:36:12,886 INFO L226 Difference]: Without dead ends: 212 [2024-11-17 00:36:12,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:36:12,887 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:12,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 872 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:36:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-17 00:36:12,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-17 00:36:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 122 states have (on average 1.7049180327868851) internal successors, (208), 196 states have internal predecessors, (208), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-17 00:36:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 225 transitions. [2024-11-17 00:36:12,898 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 225 transitions. Word has length 12 [2024-11-17 00:36:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:12,898 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 225 transitions. [2024-11-17 00:36:12,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:36:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 225 transitions. [2024-11-17 00:36:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:36:12,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:12,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:12,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-17 00:36:13,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:13,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:13,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:13,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1802821470, now seen corresponding path program 1 times [2024-11-17 00:36:13,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:13,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605775138] [2024-11-17 00:36:13,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:13,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:13,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:13,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:13,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 00:36:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:13,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:36:13,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:13,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:13,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:13,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605775138] [2024-11-17 00:36:13,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605775138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:13,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:13,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:36:13,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977828830] [2024-11-17 00:36:13,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:13,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:36:13,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:13,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:36:13,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:36:13,214 INFO L87 Difference]: Start difference. First operand 212 states and 225 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:36:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:13,256 INFO L93 Difference]: Finished difference Result 213 states and 225 transitions. [2024-11-17 00:36:13,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:36:13,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-17 00:36:13,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:13,258 INFO L225 Difference]: With dead ends: 213 [2024-11-17 00:36:13,258 INFO L226 Difference]: Without dead ends: 213 [2024-11-17 00:36:13,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:36:13,259 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 111 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:13,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 735 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:36:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-17 00:36:13,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2024-11-17 00:36:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 122 states have (on average 1.6967213114754098) internal successors, (207), 196 states have internal predecessors, (207), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-17 00:36:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 224 transitions. [2024-11-17 00:36:13,282 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 224 transitions. Word has length 12 [2024-11-17 00:36:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:13,282 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 224 transitions. [2024-11-17 00:36:13,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:36:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 224 transitions. [2024-11-17 00:36:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:36:13,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:13,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:13,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 00:36:13,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:13,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:13,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:13,485 INFO L85 PathProgramCache]: Analyzing trace with hash -60011135, now seen corresponding path program 1 times [2024-11-17 00:36:13,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:13,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849126038] [2024-11-17 00:36:13,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:13,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:13,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:13,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:13,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 00:36:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:13,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:36:13,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:13,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:13,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:13,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849126038] [2024-11-17 00:36:13,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849126038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:13,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:13,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:36:13,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433829692] [2024-11-17 00:36:13,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:13,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:36:13,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:13,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:36:13,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:36:13,600 INFO L87 Difference]: Start difference. First operand 212 states and 224 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:36:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:13,628 INFO L93 Difference]: Finished difference Result 214 states and 226 transitions. [2024-11-17 00:36:13,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:36:13,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-17 00:36:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:13,630 INFO L225 Difference]: With dead ends: 214 [2024-11-17 00:36:13,630 INFO L226 Difference]: Without dead ends: 214 [2024-11-17 00:36:13,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:36:13,632 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 103 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:13,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 751 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:36:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-17 00:36:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-11-17 00:36:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 124 states have (on average 1.685483870967742) internal successors, (209), 198 states have internal predecessors, (209), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-17 00:36:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 226 transitions. [2024-11-17 00:36:13,643 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 226 transitions. Word has length 12 [2024-11-17 00:36:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:13,643 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 226 transitions. [2024-11-17 00:36:13,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:36:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 226 transitions. [2024-11-17 00:36:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 00:36:13,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:13,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:13,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 00:36:13,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:13,847 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1836109041, now seen corresponding path program 1 times [2024-11-17 00:36:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335186254] [2024-11-17 00:36:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:13,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:13,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:13,857 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:13,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 00:36:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:13,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:36:13,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:13,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:13,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:13,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335186254] [2024-11-17 00:36:13,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335186254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:13,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:13,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:36:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446754507] [2024-11-17 00:36:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:13,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:36:13,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:36:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:36:13,951 INFO L87 Difference]: Start difference. First operand 214 states and 226 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:36:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:14,297 INFO L93 Difference]: Finished difference Result 229 states and 243 transitions. [2024-11-17 00:36:14,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:36:14,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-17 00:36:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:14,299 INFO L225 Difference]: With dead ends: 229 [2024-11-17 00:36:14,299 INFO L226 Difference]: Without dead ends: 220 [2024-11-17 00:36:14,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:36:14,300 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 53 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:14,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 398 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:36:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-17 00:36:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 208. [2024-11-17 00:36:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 119 states have (on average 1.7058823529411764) internal successors, (203), 193 states have internal predecessors, (203), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 00:36:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 219 transitions. [2024-11-17 00:36:14,308 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 219 transitions. Word has length 14 [2024-11-17 00:36:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:14,308 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 219 transitions. [2024-11-17 00:36:14,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:36:14,308 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 219 transitions. [2024-11-17 00:36:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:36:14,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:14,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:14,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-17 00:36:14,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:14,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:14,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:14,517 INFO L85 PathProgramCache]: Analyzing trace with hash 318880782, now seen corresponding path program 1 times [2024-11-17 00:36:14,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:14,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972754654] [2024-11-17 00:36:14,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:14,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:14,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:14,519 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:14,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 00:36:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:14,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:36:14,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:14,744 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-17 00:36:14,745 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-11-17 00:36:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:14,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:14,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972754654] [2024-11-17 00:36:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972754654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:14,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:14,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:36:14,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500641774] [2024-11-17 00:36:14,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:14,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:36:14,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:14,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:36:14,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:36:14,802 INFO L87 Difference]: Start difference. First operand 208 states and 219 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:36:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:15,702 INFO L93 Difference]: Finished difference Result 264 states and 278 transitions. [2024-11-17 00:36:15,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:36:15,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 16 [2024-11-17 00:36:15,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:15,705 INFO L225 Difference]: With dead ends: 264 [2024-11-17 00:36:15,705 INFO L226 Difference]: Without dead ends: 264 [2024-11-17 00:36:15,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:36:15,708 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 366 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:15,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 511 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 00:36:15,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-17 00:36:15,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 220. [2024-11-17 00:36:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 130 states have (on average 1.6846153846153846) internal successors, (219), 204 states have internal predecessors, (219), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-17 00:36:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 237 transitions. [2024-11-17 00:36:15,721 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 237 transitions. Word has length 16 [2024-11-17 00:36:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:15,721 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 237 transitions. [2024-11-17 00:36:15,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:36:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 237 transitions. [2024-11-17 00:36:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:36:15,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:15,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:15,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-17 00:36:15,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:15,923 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:15,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash 318880783, now seen corresponding path program 1 times [2024-11-17 00:36:15,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:15,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147592542] [2024-11-17 00:36:15,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:15,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:15,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:15,929 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:15,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 00:36:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:16,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 00:36:16,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:16,118 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-17 00:36:16,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:16,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:36:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:16,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:16,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:16,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147592542] [2024-11-17 00:36:16,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147592542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:16,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:16,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:36:16,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571457948] [2024-11-17 00:36:16,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:16,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:36:16,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:16,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:36:16,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-17 00:36:16,227 INFO L87 Difference]: Start difference. First operand 220 states and 237 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:36:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:17,081 INFO L93 Difference]: Finished difference Result 263 states and 277 transitions. [2024-11-17 00:36:17,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:36:17,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-11-17 00:36:17,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:17,082 INFO L225 Difference]: With dead ends: 263 [2024-11-17 00:36:17,082 INFO L226 Difference]: Without dead ends: 263 [2024-11-17 00:36:17,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2024-11-17 00:36:17,083 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 429 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 275 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:17,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 338 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 669 Invalid, 0 Unknown, 275 Unchecked, 0.7s Time] [2024-11-17 00:36:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-17 00:36:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 219. [2024-11-17 00:36:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 130 states have (on average 1.676923076923077) internal successors, (218), 203 states have internal predecessors, (218), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-17 00:36:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 236 transitions. [2024-11-17 00:36:17,089 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 236 transitions. Word has length 16 [2024-11-17 00:36:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:17,090 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 236 transitions. [2024-11-17 00:36:17,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:36:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 236 transitions. [2024-11-17 00:36:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:36:17,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:17,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:17,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-17 00:36:17,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:17,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:17,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash 399694663, now seen corresponding path program 1 times [2024-11-17 00:36:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:17,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193521943] [2024-11-17 00:36:17,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:17,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:17,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:17,296 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:17,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 00:36:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:17,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:36:17,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:17,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 00:36:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:17,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:17,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193521943] [2024-11-17 00:36:17,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193521943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:17,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:17,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:36:17,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533898889] [2024-11-17 00:36:17,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:17,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:36:17,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:17,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:36:17,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:36:17,433 INFO L87 Difference]: Start difference. First operand 219 states and 236 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:36:17,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:17,969 INFO L93 Difference]: Finished difference Result 278 states and 303 transitions. [2024-11-17 00:36:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:36:17,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-11-17 00:36:17,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:17,971 INFO L225 Difference]: With dead ends: 278 [2024-11-17 00:36:17,971 INFO L226 Difference]: Without dead ends: 278 [2024-11-17 00:36:17,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:36:17,972 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 69 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:17,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 665 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:36:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-17 00:36:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 249. [2024-11-17 00:36:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 162 states have (on average 1.6975308641975309) internal successors, (275), 233 states have internal predecessors, (275), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-17 00:36:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 293 transitions. [2024-11-17 00:36:17,982 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 293 transitions. Word has length 25 [2024-11-17 00:36:17,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:17,983 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 293 transitions. [2024-11-17 00:36:17,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:36:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 293 transitions. [2024-11-17 00:36:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:36:17,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:17,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:17,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 00:36:18,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:18,191 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:18,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:18,192 INFO L85 PathProgramCache]: Analyzing trace with hash 399694664, now seen corresponding path program 1 times [2024-11-17 00:36:18,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:18,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769188336] [2024-11-17 00:36:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:18,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:18,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:18,196 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:18,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-17 00:36:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:18,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:36:18,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:18,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:36:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:18,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:18,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:18,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769188336] [2024-11-17 00:36:18,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769188336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:18,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:18,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:36:18,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722497417] [2024-11-17 00:36:18,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:18,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:36:18,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:18,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:36:18,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:36:18,386 INFO L87 Difference]: Start difference. First operand 249 states and 293 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:36:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:18,848 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2024-11-17 00:36:18,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:36:18,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-11-17 00:36:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:18,850 INFO L225 Difference]: With dead ends: 275 [2024-11-17 00:36:18,850 INFO L226 Difference]: Without dead ends: 275 [2024-11-17 00:36:18,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:36:18,851 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 65 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:18,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 719 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:36:18,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-17 00:36:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 251. [2024-11-17 00:36:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 165 states have (on average 1.6787878787878787) internal successors, (277), 234 states have internal predecessors, (277), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 00:36:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 298 transitions. [2024-11-17 00:36:18,857 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 298 transitions. Word has length 25 [2024-11-17 00:36:18,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:18,858 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 298 transitions. [2024-11-17 00:36:18,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:36:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 298 transitions. [2024-11-17 00:36:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:36:18,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:18,859 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-11-17 00:36:18,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-17 00:36:19,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:19,059 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:19,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1650239700, now seen corresponding path program 1 times [2024-11-17 00:36:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071804284] [2024-11-17 00:36:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:19,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:19,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:19,062 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:19,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 00:36:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:19,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:36:19,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:19,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:19,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:19,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071804284] [2024-11-17 00:36:19,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071804284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:19,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:19,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:36:19,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209139556] [2024-11-17 00:36:19,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:19,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:36:19,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:19,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:36:19,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:36:19,190 INFO L87 Difference]: Start difference. First operand 251 states and 298 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:36:19,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:19,267 INFO L93 Difference]: Finished difference Result 251 states and 297 transitions. [2024-11-17 00:36:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:36:19,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 28 [2024-11-17 00:36:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:19,271 INFO L225 Difference]: With dead ends: 251 [2024-11-17 00:36:19,271 INFO L226 Difference]: Without dead ends: 251 [2024-11-17 00:36:19,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:36:19,272 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 86 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:19,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 892 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:36:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-17 00:36:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-17 00:36:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 165 states have (on average 1.6727272727272726) internal successors, (276), 234 states have internal predecessors, (276), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 00:36:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 297 transitions. [2024-11-17 00:36:19,283 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 297 transitions. Word has length 28 [2024-11-17 00:36:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:19,284 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 297 transitions. [2024-11-17 00:36:19,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:36:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 297 transitions. [2024-11-17 00:36:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 00:36:19,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:19,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:19,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-17 00:36:19,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:19,487 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:19,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash 271522106, now seen corresponding path program 1 times [2024-11-17 00:36:19,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:19,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168339511] [2024-11-17 00:36:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:19,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:19,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:19,492 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:19,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-17 00:36:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:19,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:36:19,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:19,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 00:36:19,713 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-17 00:36:19,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-17 00:36:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:19,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:19,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:19,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168339511] [2024-11-17 00:36:19,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168339511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:19,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:19,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:36:19,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866021478] [2024-11-17 00:36:19,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:19,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:36:19,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:19,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:36:19,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:36:19,775 INFO L87 Difference]: Start difference. First operand 251 states and 297 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:36:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:20,509 INFO L93 Difference]: Finished difference Result 264 states and 306 transitions. [2024-11-17 00:36:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:36:20,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-17 00:36:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:20,511 INFO L225 Difference]: With dead ends: 264 [2024-11-17 00:36:20,511 INFO L226 Difference]: Without dead ends: 264 [2024-11-17 00:36:20,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:36:20,512 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 139 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:20,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 632 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 00:36:20,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-17 00:36:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 246. [2024-11-17 00:36:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 165 states have (on average 1.612121212121212) internal successors, (266), 229 states have internal predecessors, (266), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 00:36:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 287 transitions. [2024-11-17 00:36:20,519 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 287 transitions. Word has length 33 [2024-11-17 00:36:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:20,519 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 287 transitions. [2024-11-17 00:36:20,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:36:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 287 transitions. [2024-11-17 00:36:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 00:36:20,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:20,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:20,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-17 00:36:20,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:20,721 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:20,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:20,722 INFO L85 PathProgramCache]: Analyzing trace with hash 271522107, now seen corresponding path program 1 times [2024-11-17 00:36:20,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:20,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392919101] [2024-11-17 00:36:20,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:20,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:20,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:20,724 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:20,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-17 00:36:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:20,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 00:36:20,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:20,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 00:36:20,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:36:20,936 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#t~malloc13#1.base| (select |c_#length| |ldv_zalloc_#t~malloc13#1.base|))))) is different from true [2024-11-17 00:36:20,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:20,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:36:20,992 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 00:36:20,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-17 00:36:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:21,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:21,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:21,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392919101] [2024-11-17 00:36:21,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392919101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:21,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:21,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:36:21,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136350773] [2024-11-17 00:36:21,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:21,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:36:21,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:21,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:36:21,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-17 00:36:21,061 INFO L87 Difference]: Start difference. First operand 246 states and 287 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:36:21,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:21,782 INFO L93 Difference]: Finished difference Result 302 states and 328 transitions. [2024-11-17 00:36:21,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:36:21,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-17 00:36:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:21,784 INFO L225 Difference]: With dead ends: 302 [2024-11-17 00:36:21,784 INFO L226 Difference]: Without dead ends: 302 [2024-11-17 00:36:21,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2024-11-17 00:36:21,785 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 144 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:21,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 467 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 545 Invalid, 0 Unknown, 333 Unchecked, 0.7s Time] [2024-11-17 00:36:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-17 00:36:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 246. [2024-11-17 00:36:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 229 states have internal predecessors, (261), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 00:36:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 282 transitions. [2024-11-17 00:36:21,797 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 282 transitions. Word has length 33 [2024-11-17 00:36:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:21,797 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 282 transitions. [2024-11-17 00:36:21,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:36:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 282 transitions. [2024-11-17 00:36:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 00:36:21,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:21,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:21,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-17 00:36:22,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:22,001 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:22,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1490428849, now seen corresponding path program 1 times [2024-11-17 00:36:22,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:22,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381560497] [2024-11-17 00:36:22,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:22,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:22,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:22,006 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:22,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-17 00:36:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:22,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:36:22,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:22,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:22,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381560497] [2024-11-17 00:36:22,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381560497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:22,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:22,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:36:22,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61000007] [2024-11-17 00:36:22,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:22,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:36:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:22,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:36:22,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:36:22,190 INFO L87 Difference]: Start difference. First operand 246 states and 282 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:36:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:22,208 INFO L93 Difference]: Finished difference Result 250 states and 286 transitions. [2024-11-17 00:36:22,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:36:22,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-17 00:36:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:22,210 INFO L225 Difference]: With dead ends: 250 [2024-11-17 00:36:22,210 INFO L226 Difference]: Without dead ends: 250 [2024-11-17 00:36:22,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:36:22,210 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:22,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 609 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:36:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-17 00:36:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-11-17 00:36:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 169 states have (on average 1.5680473372781065) internal successors, (265), 233 states have internal predecessors, (265), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 00:36:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 286 transitions. [2024-11-17 00:36:22,219 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 286 transitions. Word has length 36 [2024-11-17 00:36:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:22,219 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 286 transitions. [2024-11-17 00:36:22,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:36:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 286 transitions. [2024-11-17 00:36:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:36:22,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:22,223 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] [2024-11-17 00:36:22,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-17 00:36:22,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:22,427 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:22,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:22,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1041424234, now seen corresponding path program 1 times [2024-11-17 00:36:22,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:22,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374202787] [2024-11-17 00:36:22,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:22,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:22,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:22,429 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:22,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-17 00:36:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:22,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:36:22,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:22,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:22,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:22,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374202787] [2024-11-17 00:36:22,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374202787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:22,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:22,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:36:22,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289305698] [2024-11-17 00:36:22,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:22,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:36:22,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:22,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:36:22,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:36:22,948 INFO L87 Difference]: Start difference. First operand 250 states and 286 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:36:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:23,368 INFO L93 Difference]: Finished difference Result 248 states and 283 transitions. [2024-11-17 00:36:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:36:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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 37 [2024-11-17 00:36:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:23,370 INFO L225 Difference]: With dead ends: 248 [2024-11-17 00:36:23,370 INFO L226 Difference]: Without dead ends: 248 [2024-11-17 00:36:23,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:36:23,370 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 254 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:23,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 765 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:36:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-17 00:36:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2024-11-17 00:36:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 169 states have (on average 1.5502958579881656) internal successors, (262), 231 states have internal predecessors, (262), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 00:36:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 283 transitions. [2024-11-17 00:36:23,377 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 283 transitions. Word has length 37 [2024-11-17 00:36:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:23,377 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 283 transitions. [2024-11-17 00:36:23,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:36:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 283 transitions. [2024-11-17 00:36:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:36:23,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:23,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:23,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-17 00:36:23,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:23,579 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:23,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:23,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1387953584, now seen corresponding path program 1 times [2024-11-17 00:36:23,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:23,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947493182] [2024-11-17 00:36:23,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:23,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:23,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:23,581 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:23,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-17 00:36:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:23,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:36:23,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:23,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:23,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:23,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947493182] [2024-11-17 00:36:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947493182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:23,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:23,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:36:23,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738130533] [2024-11-17 00:36:23,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:23,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:36:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:23,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:36:23,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:36:23,748 INFO L87 Difference]: Start difference. First operand 248 states and 283 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:36:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:23,766 INFO L93 Difference]: Finished difference Result 250 states and 285 transitions. [2024-11-17 00:36:23,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:36:23,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-17 00:36:23,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:23,768 INFO L225 Difference]: With dead ends: 250 [2024-11-17 00:36:23,768 INFO L226 Difference]: Without dead ends: 250 [2024-11-17 00:36:23,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:36:23,769 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:23,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 602 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:36:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-17 00:36:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-11-17 00:36:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 171 states have (on average 1.543859649122807) internal successors, (264), 233 states have internal predecessors, (264), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 00:36:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 285 transitions. [2024-11-17 00:36:23,778 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 285 transitions. Word has length 43 [2024-11-17 00:36:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:23,779 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 285 transitions. [2024-11-17 00:36:23,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:36:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 285 transitions. [2024-11-17 00:36:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:36:23,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:23,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-17 00:36:23,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:23,982 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:23,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash 76938860, now seen corresponding path program 1 times [2024-11-17 00:36:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:23,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787474488] [2024-11-17 00:36:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:23,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:23,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:23,984 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:23,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-17 00:36:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:24,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 00:36:24,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:24,288 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-17 00:36:24,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-17 00:36:24,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-17 00:36:24,505 INFO L349 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2024-11-17 00:36:24,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2024-11-17 00:36:24,974 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-17 00:36:24,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:24,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-17 00:36:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:25,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:25,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:25,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787474488] [2024-11-17 00:36:25,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787474488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:25,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:25,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 00:36:25,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381098428] [2024-11-17 00:36:25,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:25,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:36:25,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:25,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:36:25,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:36:25,049 INFO L87 Difference]: Start difference. First operand 250 states and 285 transitions. Second operand has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:36:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:26,926 INFO L93 Difference]: Finished difference Result 353 states and 387 transitions. [2024-11-17 00:36:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:36:26,927 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 44 [2024-11-17 00:36:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:26,928 INFO L225 Difference]: With dead ends: 353 [2024-11-17 00:36:26,928 INFO L226 Difference]: Without dead ends: 353 [2024-11-17 00:36:26,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:36:26,929 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 778 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:26,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 840 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 00:36:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-17 00:36:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 272. [2024-11-17 00:36:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 191 states have (on average 1.544502617801047) internal successors, (295), 251 states have internal predecessors, (295), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-17 00:36:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 319 transitions. [2024-11-17 00:36:26,937 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 319 transitions. Word has length 44 [2024-11-17 00:36:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:26,938 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 319 transitions. [2024-11-17 00:36:26,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:36:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 319 transitions. [2024-11-17 00:36:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:36:26,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:26,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:26,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-17 00:36:27,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:27,140 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:27,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash 76938861, now seen corresponding path program 1 times [2024-11-17 00:36:27,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:27,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601904548] [2024-11-17 00:36:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:27,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:27,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:27,143 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:27,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-17 00:36:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:27,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-17 00:36:27,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:27,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:27,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:36:27,508 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 00:36:27,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-17 00:36:27,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:27,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:36:27,874 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:36:27,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:36:28,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-11-17 00:36:28,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:28,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:28,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601904548] [2024-11-17 00:36:28,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601904548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:28,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:28,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:36:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380011407] [2024-11-17 00:36:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:28,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 00:36:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:28,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 00:36:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:36:28,084 INFO L87 Difference]: Start difference. First operand 272 states and 319 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:36:30,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:36:30,127 INFO L93 Difference]: Finished difference Result 299 states and 342 transitions. [2024-11-17 00:36:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:36:30,128 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 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 44 [2024-11-17 00:36:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:36:30,129 INFO L225 Difference]: With dead ends: 299 [2024-11-17 00:36:30,129 INFO L226 Difference]: Without dead ends: 299 [2024-11-17 00:36:30,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:36:30,130 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 642 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:36:30,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 532 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 00:36:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-17 00:36:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 260. [2024-11-17 00:36:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 183 states have (on average 1.5191256830601092) internal successors, (278), 240 states have internal predecessors, (278), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 00:36:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 299 transitions. [2024-11-17 00:36:30,136 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 299 transitions. Word has length 44 [2024-11-17 00:36:30,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:36:30,136 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 299 transitions. [2024-11-17 00:36:30,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:36:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 299 transitions. [2024-11-17 00:36:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:36:30,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:36:30,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:36:30,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-17 00:36:30,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:30,338 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:36:30,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:36:30,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1783834158, now seen corresponding path program 1 times [2024-11-17 00:36:30,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:36:30,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086818718] [2024-11-17 00:36:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:36:30,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:36:30,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:36:30,340 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:36:30,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-17 00:36:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:36:30,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 00:36:30,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:36:30,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:30,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:30,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:30,593 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:36:30,593 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:36:30,594 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:36:30,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-17 00:36:30,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:30,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:30,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:30,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:30,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:30,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:30,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:30,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 81 [2024-11-17 00:36:32,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:32,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:32,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:32,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:32,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:32,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:32,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:32,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:32,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:32,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:36:32,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 55 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 130 [2024-11-17 00:36:35,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:36:35,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 161 treesize of output 142 [2024-11-17 00:36:38,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:36:38,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 140 treesize of output 54 [2024-11-17 00:36:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:36:38,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:36:38,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:36:38,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086818718] [2024-11-17 00:36:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086818718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:36:38,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:36:38,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:36:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739444190] [2024-11-17 00:36:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:36:38,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:36:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:36:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:36:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=31, Unknown=5, NotChecked=0, Total=56 [2024-11-17 00:36:38,425 INFO L87 Difference]: Start difference. First operand 260 states and 299 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:36:42,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:36:46,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:36:50,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:36:51,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:36:53,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:36:54,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:36:58,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:37:02,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:37:04,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:37:06,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:37:10,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:37:14,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:37:18,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:37:20,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:37:22,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:37:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:37:22,729 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2024-11-17 00:37:22,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:37:22,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-17 00:37:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:37:22,731 INFO L225 Difference]: With dead ends: 269 [2024-11-17 00:37:22,731 INFO L226 Difference]: Without dead ends: 269 [2024-11-17 00:37:22,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=24, Invalid=43, Unknown=5, NotChecked=0, Total=72 [2024-11-17 00:37:22,731 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 64 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:37:22,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 703 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 15 Unknown, 0 Unchecked, 44.2s Time] [2024-11-17 00:37:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-17 00:37:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 259. [2024-11-17 00:37:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 183 states have (on average 1.5081967213114753) internal successors, (276), 239 states have internal predecessors, (276), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 00:37:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 297 transitions. [2024-11-17 00:37:22,743 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 297 transitions. Word has length 44 [2024-11-17 00:37:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:37:22,743 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 297 transitions. [2024-11-17 00:37:22,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:37:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 297 transitions. [2024-11-17 00:37:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-17 00:37:22,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:37:22,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:37:22,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-17 00:37:22,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:37:22,946 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:37:22,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:37:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash 923817274, now seen corresponding path program 1 times [2024-11-17 00:37:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:37:22,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866223664] [2024-11-17 00:37:22,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:37:22,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:37:22,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:37:22,950 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:37:22,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-17 00:37:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:37:23,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:37:23,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:37:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:37:23,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:37:23,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:37:23,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866223664] [2024-11-17 00:37:23,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866223664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:37:23,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:37:23,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:37:23,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688777008] [2024-11-17 00:37:23,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:37:23,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:37:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:37:23,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:37:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:37:23,098 INFO L87 Difference]: Start difference. First operand 259 states and 297 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:37:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:37:23,111 INFO L93 Difference]: Finished difference Result 261 states and 298 transitions. [2024-11-17 00:37:23,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:37:23,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 46 [2024-11-17 00:37:23,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:37:23,112 INFO L225 Difference]: With dead ends: 261 [2024-11-17 00:37:23,112 INFO L226 Difference]: Without dead ends: 261 [2024-11-17 00:37:23,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:37:23,113 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:37:23,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:37:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-17 00:37:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-11-17 00:37:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 185 states have (on average 1.4972972972972973) internal successors, (277), 241 states have internal predecessors, (277), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 00:37:23,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 298 transitions. [2024-11-17 00:37:23,119 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 298 transitions. Word has length 46 [2024-11-17 00:37:23,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:37:23,119 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 298 transitions. [2024-11-17 00:37:23,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:37:23,119 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 298 transitions. [2024-11-17 00:37:23,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-17 00:37:23,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:37:23,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:37:23,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-17 00:37:23,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:37:23,321 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting free_reportsErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:37:23,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:37:23,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1426750423, now seen corresponding path program 1 times [2024-11-17 00:37:23,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:37:23,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033257755] [2024-11-17 00:37:23,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:37:23,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:37:23,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:37:23,323 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:37:23,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-17 00:37:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:37:23,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-17 00:37:23,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:37:23,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 00:37:23,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:37:23,722 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-17 00:37:23,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-11-17 00:37:23,787 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-17 00:37:23,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:37:24,009 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-17 00:37:24,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-11-17 00:37:24,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2024-11-17 00:37:24,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2024-11-17 00:37:25,078 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-17 00:37:25,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2024-11-17 00:37:25,158 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-17 00:37:25,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:37:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:37:25,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:37:25,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:37:25,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033257755] [2024-11-17 00:37:25,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033257755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:37:25,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:37:25,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-17 00:37:25,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878207130] [2024-11-17 00:37:25,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:37:25,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 00:37:25,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:37:25,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 00:37:25,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-17 00:37:25,315 INFO L87 Difference]: Start difference. First operand 261 states and 298 transitions. Second operand has 19 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:37:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:37:29,528 INFO L93 Difference]: Finished difference Result 412 states and 460 transitions. [2024-11-17 00:37:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 00:37:29,530 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2024-11-17 00:37:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:37:29,531 INFO L225 Difference]: With dead ends: 412 [2024-11-17 00:37:29,531 INFO L226 Difference]: Without dead ends: 412 [2024-11-17 00:37:29,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2024-11-17 00:37:29,532 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 537 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:37:29,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1387 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1664 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2024-11-17 00:37:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-17 00:37:29,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 330. [2024-11-17 00:37:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 248 states have (on average 1.5040322580645162) internal successors, (373), 306 states have internal predecessors, (373), 12 states have call successors, (12), 10 states have call predecessors, (12), 11 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-17 00:37:29,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 402 transitions. [2024-11-17 00:37:29,540 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 402 transitions. Word has length 47 [2024-11-17 00:37:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:37:29,540 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 402 transitions. [2024-11-17 00:37:29,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:37:29,541 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 402 transitions. [2024-11-17 00:37:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-17 00:37:29,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:37:29,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:37:29,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-17 00:37:29,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:37:29,742 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting free_reportsErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 76 more)] === [2024-11-17 00:37:29,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:37:29,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1426750422, now seen corresponding path program 1 times [2024-11-17 00:37:29,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:37:29,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67118453] [2024-11-17 00:37:29,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:37:29,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:37:29,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:37:29,745 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:37:29,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-17 00:37:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:37:29,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-17 00:37:29,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:37:29,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 00:37:30,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 5 [2024-11-17 00:37:30,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:37:30,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:37:30,351 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-17 00:37:30,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-11-17 00:37:30,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-17 00:37:30,435 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-17 00:37:30,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:37:30,447 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-11-17 00:37:30,784 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-17 00:37:30,785 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 26 [2024-11-17 00:37:30,842 INFO L349 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2024-11-17 00:37:30,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2024-11-17 00:37:31,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-17 00:37:31,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:37:31,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:37:31,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-17 00:37:32,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-17 00:37:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:37:32,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:37:32,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:37:32,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67118453] [2024-11-17 00:37:32,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67118453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:37:32,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:37:32,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-17 00:37:32,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318786171] [2024-11-17 00:37:32,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:37:32,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 00:37:32,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:37:32,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 00:37:32,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:37:32,615 INFO L87 Difference]: Start difference. First operand 330 states and 402 transitions. Second operand has 21 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 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)