./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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/uthash-2.0.2/uthash_FNV_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:26:22,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:26:22,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:26:22,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:26:22,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:26:22,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:26:22,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:26:22,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:26:22,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:26:22,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:26:22,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:26:22,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:26:22,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:26:22,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:26:22,722 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:26:22,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:26:22,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:26:22,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:26:22,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:26:22,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:26:22,724 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:26:22,727 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:26:22,727 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:26:22,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:26:22,727 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:26:22,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:26:22,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:26:22,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:26:22,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:26:22,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:26:22,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:26:22,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:26:22,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:26:22,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:26:22,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:26:22,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:26:22,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:26:22,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:26:22,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:26:22,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:26:22,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:26:22,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:26:22,732 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-11-10 17:26:22,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:26:23,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:26:23,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:26:23,026 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:26:23,026 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:26:23,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-11-10 17:26:24,501 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:26:24,807 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:26:24,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-11-10 17:26:24,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bee4b8a6/fd11b22461164d59a421e5b2f4ed488e/FLAG3c19c7b34 [2024-11-10 17:26:25,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bee4b8a6/fd11b22461164d59a421e5b2f4ed488e [2024-11-10 17:26:25,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:26:25,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:26:25,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:26:25,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:26:25,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:26:25,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:26:25" (1/1) ... [2024-11-10 17:26:25,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5def6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:25, skipping insertion in model container [2024-11-10 17:26:25,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:26:25" (1/1) ... [2024-11-10 17:26:25,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:26:25,546 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-10 17:26:25,594 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-10 17:26:25,599 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-10 17:26:25,607 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-10 17:26:25,620 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-10 17:26:25,673 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-10 17:26:25,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-10 17:26:25,678 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-10 17:26:25,679 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-10 17:26:25,681 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-10 17:26:25,683 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-10 17:26:25,684 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-10 17:26:25,685 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-10 17:26:25,693 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-10 17:26:25,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:26:25,719 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-10 17:26:25,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1b222205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:25, skipping insertion in model container [2024-11-10 17:26:25,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:26:25,722 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 17:26:25,724 INFO L158 Benchmark]: Toolchain (without parser) took 649.62ms. Allocated memory is still 172.0MB. Free memory was 112.3MB in the beginning and 89.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 17:26:25,725 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 172.0MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:26:25,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 647.32ms. Allocated memory is still 172.0MB. Free memory was 112.3MB in the beginning and 89.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 17:26:25,727 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.17ms. Allocated memory is still 172.0MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 647.32ms. Allocated memory is still 172.0MB. Free memory was 112.3MB in the beginning and 89.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 750]: 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/uthash-2.0.2/uthash_FNV_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:26:27,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:26:27,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:26:27,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:26:27,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:26:27,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:26:27,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:26:27,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:26:27,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:26:27,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:26:27,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:26:27,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:26:27,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:26:27,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:26:27,830 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:26:27,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:26:27,831 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:26:27,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:26:27,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:26:27,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:26:27,832 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:26:27,832 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:26:27,834 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:26:27,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:26:27,835 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:26:27,835 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:26:27,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:26:27,835 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:26:27,836 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:26:27,836 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:26:27,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:26:27,837 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:26:27,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:26:27,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:26:27,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:26:27,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:26:27,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:26:27,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:26:27,840 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:26:27,840 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:26:27,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:26:27,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:26:27,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:26:27,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:26:27,842 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-11-10 17:26:28,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:26:28,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:26:28,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:26:28,210 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:26:28,211 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:26:28,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-11-10 17:26:29,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:26:29,963 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:26:29,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-11-10 17:26:29,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7509612e1/3bc0fc22d0354d3086c4882911b68983/FLAG0a5c252e3 [2024-11-10 17:26:30,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7509612e1/3bc0fc22d0354d3086c4882911b68983 [2024-11-10 17:26:30,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:26:30,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:26:30,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:26:30,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:26:30,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:26:30,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:26:30" (1/1) ... [2024-11-10 17:26:30,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ad178a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:30, skipping insertion in model container [2024-11-10 17:26:30,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:26:30" (1/1) ... [2024-11-10 17:26:30,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:26:30,724 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-10 17:26:30,778 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-10 17:26:30,784 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-10 17:26:30,790 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-10 17:26:30,797 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-10 17:26:30,831 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-10 17:26:30,834 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-10 17:26:30,836 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-10 17:26:30,837 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-10 17:26:30,841 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-10 17:26:30,845 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-10 17:26:30,846 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-10 17:26:30,850 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-10 17:26:30,854 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-10 17:26:30,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:26:30,882 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 17:26:30,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:26:30,924 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-10 17:26:30,941 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-10 17:26:30,943 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-10 17:26:30,945 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-10 17:26:30,950 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-10 17:26:30,979 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-10 17:26:30,983 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-10 17:26:30,985 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-10 17:26:30,985 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-10 17:26:30,987 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-10 17:26:30,992 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-10 17:26:30,992 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-10 17:26:30,993 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-10 17:26:30,998 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-10 17:26:31,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:26:31,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:26:31,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:26:31,129 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:26:31,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31 WrapperNode [2024-11-10 17:26:31,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:26:31,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:26:31,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:26:31,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:26:31,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31" (1/1) ... [2024-11-10 17:26:31,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31" (1/1) ... [2024-11-10 17:26:31,232 INFO L138 Inliner]: procedures = 180, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1015 [2024-11-10 17:26:31,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:26:31,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:26:31,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:26:31,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:26:31,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31" (1/1) ... [2024-11-10 17:26:31,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31" (1/1) ... [2024-11-10 17:26:31,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31" (1/1) ... [2024-11-10 17:26:31,335 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-10 17:26:31,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31" (1/1) ... [2024-11-10 17:26:31,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31" (1/1) ... [2024-11-10 17:26:31,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31" (1/1) ... [2024-11-10 17:26:31,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31" (1/1) ... [2024-11-10 17:26:31,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31" (1/1) ... [2024-11-10 17:26:31,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31" (1/1) ... [2024-11-10 17:26:31,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:26:31,432 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:26:31,432 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:26:31,433 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:26:31,434 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31" (1/1) ... [2024-11-10 17:26:31,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:26:31,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:26:31,466 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-10 17:26:31,469 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-10 17:26:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 17:26:31,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 17:26:31,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 17:26:31,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 17:26:31,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 17:26:31,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 17:26:31,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 17:26:31,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 17:26:31,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:26:31,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:26:31,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-10 17:26:31,519 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:26:31,519 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:26:31,520 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-10 17:26:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:26:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:26:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:26:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:26:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 17:26:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 17:26:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:26:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:26:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 17:26:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 17:26:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 17:26:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 17:26:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:26:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:26:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 17:26:31,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 17:26:31,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:26:31,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:26:31,748 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:26:31,751 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:26:35,181 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-10 17:26:35,318 INFO L? ?]: Removed 1080 outVars from TransFormulas that were not future-live. [2024-11-10 17:26:35,318 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:26:35,362 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:26:35,362 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:26:35,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:26:35 BoogieIcfgContainer [2024-11-10 17:26:35,363 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:26:35,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:26:35,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:26:35,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:26:35,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:26:30" (1/3) ... [2024-11-10 17:26:35,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d8322e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:26:35, skipping insertion in model container [2024-11-10 17:26:35,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:31" (2/3) ... [2024-11-10 17:26:35,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d8322e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:26:35, skipping insertion in model container [2024-11-10 17:26:35,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:26:35" (3/3) ... [2024-11-10 17:26:35,372 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test3-1.i [2024-11-10 17:26:35,389 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:26:35,390 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 525 error locations. [2024-11-10 17:26:35,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:26:35,464 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;@1b608076, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:26:35,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-11-10 17:26:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 1086 states, 556 states have (on average 2.1636690647482015) internal successors, (1203), 1079 states have internal predecessors, (1203), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 17:26:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 17:26:35,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:35,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 17:26:35,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:35,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:35,487 INFO L85 PathProgramCache]: Analyzing trace with hash 38232700, now seen corresponding path program 1 times [2024-11-10 17:26:35,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:35,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000665026] [2024-11-10 17:26:35,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:35,498 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-10 17:26:35,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:35,501 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-10 17:26:35,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 17:26:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:35,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:26:35,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:35,690 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-10 17:26:35,706 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-10 17:26:35,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:35,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:35,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000665026] [2024-11-10 17:26:35,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000665026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:35,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:35,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:26:35,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713238376] [2024-11-10 17:26:35,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:35,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:26:35,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:35,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:26:35,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:35,761 INFO L87 Difference]: Start difference. First operand has 1086 states, 556 states have (on average 2.1636690647482015) internal successors, (1203), 1079 states have internal predecessors, (1203), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:37,051 INFO L93 Difference]: Finished difference Result 1083 states and 1143 transitions. [2024-11-10 17:26:37,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:26:37,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-10 17:26:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:37,069 INFO L225 Difference]: With dead ends: 1083 [2024-11-10 17:26:37,070 INFO L226 Difference]: Without dead ends: 1080 [2024-11-10 17:26:37,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:37,074 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 987 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:37,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 719 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:26:37,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-11-10 17:26:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1071. [2024-11-10 17:26:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 557 states have (on average 2.012567324955117) internal successors, (1121), 1063 states have internal predecessors, (1121), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 17:26:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1131 transitions. [2024-11-10 17:26:37,158 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1131 transitions. Word has length 4 [2024-11-10 17:26:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:37,158 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1131 transitions. [2024-11-10 17:26:37,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:37,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1131 transitions. [2024-11-10 17:26:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 17:26:37,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:37,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 17:26:37,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 17:26:37,360 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-10 17:26:37,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:37,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:37,361 INFO L85 PathProgramCache]: Analyzing trace with hash 38232701, now seen corresponding path program 1 times [2024-11-10 17:26:37,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:37,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783832698] [2024-11-10 17:26:37,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:37,363 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-10 17:26:37,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:37,366 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-10 17:26:37,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 17:26:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:37,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:26:37,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:37,501 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-10 17:26:37,519 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-10 17:26:37,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:37,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:37,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783832698] [2024-11-10 17:26:37,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783832698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:37,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:37,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:26:37,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730037221] [2024-11-10 17:26:37,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:37,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:26:37,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:37,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:26:37,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:37,523 INFO L87 Difference]: Start difference. First operand 1071 states and 1131 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:39,382 INFO L93 Difference]: Finished difference Result 1491 states and 1585 transitions. [2024-11-10 17:26:39,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:26:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-10 17:26:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:39,388 INFO L225 Difference]: With dead ends: 1491 [2024-11-10 17:26:39,388 INFO L226 Difference]: Without dead ends: 1491 [2024-11-10 17:26:39,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:39,389 INFO L432 NwaCegarLoop]: 928 mSDtfsCounter, 448 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:39,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1529 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 17:26:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2024-11-10 17:26:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1295. [2024-11-10 17:26:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 781 states have (on average 1.9948783610755443) internal successors, (1558), 1286 states have internal predecessors, (1558), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:26:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1570 transitions. [2024-11-10 17:26:39,436 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1570 transitions. Word has length 4 [2024-11-10 17:26:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:39,437 INFO L471 AbstractCegarLoop]: Abstraction has 1295 states and 1570 transitions. [2024-11-10 17:26:39,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1570 transitions. [2024-11-10 17:26:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 17:26:39,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:39,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 17:26:39,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 17:26:39,640 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-10 17:26:39,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:39,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1185175928, now seen corresponding path program 1 times [2024-11-10 17:26:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:39,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904316953] [2024-11-10 17:26:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:39,643 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-10 17:26:39,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:39,645 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-10 17:26:39,646 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-10 17:26:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:39,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:26:39,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:39,793 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_48|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_48| (_ bv0 1))))) is different from true [2024-11-10 17:26:39,809 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-10 17:26:39,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:39,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:39,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904316953] [2024-11-10 17:26:39,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904316953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:39,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:39,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:26:39,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135568887] [2024-11-10 17:26:39,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:39,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:39,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:39,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:39,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-10 17:26:39,814 INFO L87 Difference]: Start difference. First operand 1295 states and 1570 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:41,828 INFO L93 Difference]: Finished difference Result 1703 states and 2009 transitions. [2024-11-10 17:26:41,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:26:41,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 17:26:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:41,834 INFO L225 Difference]: With dead ends: 1703 [2024-11-10 17:26:41,835 INFO L226 Difference]: Without dead ends: 1701 [2024-11-10 17:26:41,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-10 17:26:41,837 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 437 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1562 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:41,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1526 Invalid, 2285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 723 Invalid, 0 Unknown, 1562 Unchecked, 1.9s Time] [2024-11-10 17:26:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2024-11-10 17:26:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1295. [2024-11-10 17:26:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 781 states have (on average 1.9935979513444302) internal successors, (1557), 1286 states have internal predecessors, (1557), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:26:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1569 transitions. [2024-11-10 17:26:41,879 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1569 transitions. Word has length 5 [2024-11-10 17:26:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:41,879 INFO L471 AbstractCegarLoop]: Abstraction has 1295 states and 1569 transitions. [2024-11-10 17:26:41,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1569 transitions. [2024-11-10 17:26:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:26:41,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:41,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:41,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 17:26:42,083 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-10 17:26:42,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:42,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1554641611, now seen corresponding path program 1 times [2024-11-10 17:26:42,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:42,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840433790] [2024-11-10 17:26:42,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:42,085 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-10 17:26:42,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:42,088 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-10 17:26:42,089 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-10 17:26:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:42,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:26:42,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:42,233 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-10 17:26:42,243 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-10 17:26:42,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:26:42,339 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-10 17:26:42,359 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:26:42,359 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-10 17:26:42,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-10 17:26:42,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:42,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:42,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840433790] [2024-11-10 17:26:42,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840433790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:42,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:42,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:26:42,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620317499] [2024-11-10 17:26:42,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:42,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:42,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:42,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:42,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:42,386 INFO L87 Difference]: Start difference. First operand 1295 states and 1569 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:44,223 INFO L93 Difference]: Finished difference Result 1299 states and 1574 transitions. [2024-11-10 17:26:44,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:26:44,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 17:26:44,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:44,228 INFO L225 Difference]: With dead ends: 1299 [2024-11-10 17:26:44,228 INFO L226 Difference]: Without dead ends: 1299 [2024-11-10 17:26:44,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:44,229 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 2062 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2067 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:44,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2067 Valid, 428 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 17:26:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2024-11-10 17:26:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1059. [2024-11-10 17:26:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 557 states have (on average 1.985637342908438) internal successors, (1106), 1051 states have internal predecessors, (1106), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 17:26:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1116 transitions. [2024-11-10 17:26:44,250 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1116 transitions. Word has length 9 [2024-11-10 17:26:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:44,251 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1116 transitions. [2024-11-10 17:26:44,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1116 transitions. [2024-11-10 17:26:44,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 17:26:44,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:44,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:44,256 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 (5)] Forceful destruction successful, exit code 0 [2024-11-10 17:26:44,455 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-10 17:26:44,455 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr516REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:44,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:44,456 INFO L85 PathProgramCache]: Analyzing trace with hash -949248558, now seen corresponding path program 1 times [2024-11-10 17:26:44,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:44,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943845869] [2024-11-10 17:26:44,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:44,456 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-10 17:26:44,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:44,460 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-10 17:26:44,461 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-10 17:26:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:44,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:26:44,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:44,582 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-10 17:26:44,592 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-10 17:26:44,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:44,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:44,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943845869] [2024-11-10 17:26:44,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943845869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:44,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:44,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:26:44,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751092330] [2024-11-10 17:26:44,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:44,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:26:44,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:44,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:26:44,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:44,593 INFO L87 Difference]: Start difference. First operand 1059 states and 1116 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:46,042 INFO L93 Difference]: Finished difference Result 1409 states and 1497 transitions. [2024-11-10 17:26:46,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:26:46,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 17:26:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:46,047 INFO L225 Difference]: With dead ends: 1409 [2024-11-10 17:26:46,047 INFO L226 Difference]: Without dead ends: 1409 [2024-11-10 17:26:46,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:46,048 INFO L432 NwaCegarLoop]: 987 mSDtfsCounter, 951 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:46,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 1248 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:26:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-11-10 17:26:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1011. [2024-11-10 17:26:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 557 states have (on average 1.8994614003590664) internal successors, (1058), 1003 states have internal predecessors, (1058), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 17:26:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1068 transitions. [2024-11-10 17:26:46,067 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1068 transitions. Word has length 10 [2024-11-10 17:26:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:46,067 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1068 transitions. [2024-11-10 17:26:46,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1068 transitions. [2024-11-10 17:26:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 17:26:46,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:46,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:46,072 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-10 17:26:46,268 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-10 17:26:46,269 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:46,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash -949248557, now seen corresponding path program 1 times [2024-11-10 17:26:46,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:46,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755328680] [2024-11-10 17:26:46,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:46,270 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-10 17:26:46,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:46,271 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-10 17:26:46,272 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-10 17:26:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:46,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:26:46,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:46,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:26:46,410 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-10 17:26:46,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:46,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:46,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755328680] [2024-11-10 17:26:46,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755328680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:46,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:46,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:26:46,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901811752] [2024-11-10 17:26:46,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:46,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:26:46,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:46,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:26:46,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:46,413 INFO L87 Difference]: Start difference. First operand 1011 states and 1068 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:48,124 INFO L93 Difference]: Finished difference Result 1499 states and 1590 transitions. [2024-11-10 17:26:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:26:48,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 17:26:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:48,128 INFO L225 Difference]: With dead ends: 1499 [2024-11-10 17:26:48,128 INFO L226 Difference]: Without dead ends: 1499 [2024-11-10 17:26:48,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:48,130 INFO L432 NwaCegarLoop]: 1182 mSDtfsCounter, 710 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:48,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1629 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:26:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2024-11-10 17:26:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1040. [2024-11-10 17:26:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 596 states have (on average 1.8859060402684564) internal successors, (1124), 1032 states have internal predecessors, (1124), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 17:26:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1134 transitions. [2024-11-10 17:26:48,150 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1134 transitions. Word has length 10 [2024-11-10 17:26:48,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:48,150 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1134 transitions. [2024-11-10 17:26:48,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1134 transitions. [2024-11-10 17:26:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 17:26:48,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:48,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:48,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 17:26:48,356 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-10 17:26:48,356 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:48,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:48,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2116858292, now seen corresponding path program 1 times [2024-11-10 17:26:48,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:48,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322827616] [2024-11-10 17:26:48,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:48,357 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-10 17:26:48,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:48,361 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-10 17:26:48,362 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-10 17:26:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:48,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:26:48,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:48,579 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-10 17:26:48,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:48,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:48,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322827616] [2024-11-10 17:26:48,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322827616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:48,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:48,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:26:48,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270424651] [2024-11-10 17:26:48,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:48,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:48,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:48,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:48,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:48,582 INFO L87 Difference]: Start difference. First operand 1040 states and 1134 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:49,050 INFO L93 Difference]: Finished difference Result 1477 states and 1627 transitions. [2024-11-10 17:26:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:26:49,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-10 17:26:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:49,055 INFO L225 Difference]: With dead ends: 1477 [2024-11-10 17:26:49,055 INFO L226 Difference]: Without dead ends: 1477 [2024-11-10 17:26:49,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-10 17:26:49,056 INFO L432 NwaCegarLoop]: 1119 mSDtfsCounter, 457 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 3101 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:49,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 3101 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 17:26:49,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2024-11-10 17:26:49,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1296. [2024-11-10 17:26:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 851 states have (on average 1.873090481786134) internal successors, (1594), 1287 states have internal predecessors, (1594), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:26:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1606 transitions. [2024-11-10 17:26:49,092 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1606 transitions. Word has length 15 [2024-11-10 17:26:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:49,092 INFO L471 AbstractCegarLoop]: Abstraction has 1296 states and 1606 transitions. [2024-11-10 17:26:49,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:49,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1606 transitions. [2024-11-10 17:26:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 17:26:49,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:49,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:49,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-10 17:26:49,294 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-10 17:26:49,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:49,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1513642788, now seen corresponding path program 1 times [2024-11-10 17:26:49,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:49,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213747272] [2024-11-10 17:26:49,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:49,299 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-10 17:26:49,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:49,302 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-10 17:26:49,303 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-10 17:26:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:49,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:26:49,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:49,575 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_49| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_49| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_49|)))) is different from true [2024-11-10 17:26:49,584 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-10 17:26:49,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:49,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:49,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213747272] [2024-11-10 17:26:49,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213747272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:49,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:49,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:26:49,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595612980] [2024-11-10 17:26:49,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:49,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:49,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:49,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-10 17:26:49,587 INFO L87 Difference]: Start difference. First operand 1296 states and 1606 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:50,762 INFO L93 Difference]: Finished difference Result 1668 states and 2061 transitions. [2024-11-10 17:26:50,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:26:50,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-10 17:26:50,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:50,767 INFO L225 Difference]: With dead ends: 1668 [2024-11-10 17:26:50,767 INFO L226 Difference]: Without dead ends: 1662 [2024-11-10 17:26:50,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-10 17:26:50,768 INFO L432 NwaCegarLoop]: 907 mSDtfsCounter, 330 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1395 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:50,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1486 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 619 Invalid, 0 Unknown, 1395 Unchecked, 1.1s Time] [2024-11-10 17:26:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2024-11-10 17:26:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1382. [2024-11-10 17:26:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 936 states have (on average 1.856837606837607) internal successors, (1738), 1372 states have internal predecessors, (1738), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 17:26:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1752 transitions. [2024-11-10 17:26:50,800 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1752 transitions. Word has length 17 [2024-11-10 17:26:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:50,800 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1752 transitions. [2024-11-10 17:26:50,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1752 transitions. [2024-11-10 17:26:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 17:26:50,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:50,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:50,807 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-10 17:26:51,005 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-10 17:26:51,006 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr192REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:51,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:51,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1051991125, now seen corresponding path program 1 times [2024-11-10 17:26:51,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:51,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958791937] [2024-11-10 17:26:51,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:51,007 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-10 17:26:51,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:51,008 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-10 17:26:51,010 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-10 17:26:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:51,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:26:51,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:51,136 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-10 17:26:51,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:51,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:51,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958791937] [2024-11-10 17:26:51,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958791937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:51,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:51,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:26:51,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073460497] [2024-11-10 17:26:51,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:51,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:26:51,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:51,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:26:51,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:51,138 INFO L87 Difference]: Start difference. First operand 1382 states and 1752 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:51,166 INFO L93 Difference]: Finished difference Result 1304 states and 1623 transitions. [2024-11-10 17:26:51,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:26:51,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-10 17:26:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:51,171 INFO L225 Difference]: With dead ends: 1304 [2024-11-10 17:26:51,171 INFO L226 Difference]: Without dead ends: 1304 [2024-11-10 17:26:51,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:51,172 INFO L432 NwaCegarLoop]: 994 mSDtfsCounter, 71 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:51,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1924 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:26:51,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2024-11-10 17:26:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2024-11-10 17:26:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 882 states have (on average 1.8242630385487528) internal successors, (1609), 1294 states have internal predecessors, (1609), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 17:26:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1623 transitions. [2024-11-10 17:26:51,193 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1623 transitions. Word has length 17 [2024-11-10 17:26:51,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:51,193 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1623 transitions. [2024-11-10 17:26:51,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:51,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1623 transitions. [2024-11-10 17:26:51,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 17:26:51,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:51,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:51,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-10 17:26:51,395 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-10 17:26:51,395 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr168REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:51,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:51,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1646213473, now seen corresponding path program 1 times [2024-11-10 17:26:51,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:51,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121272424] [2024-11-10 17:26:51,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:51,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:26:51,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:51,397 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-10 17:26:51,400 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-10 17:26:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:51,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:26:51,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:51,537 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-10 17:26:51,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:51,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:51,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121272424] [2024-11-10 17:26:51,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121272424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:51,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:51,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:26:51,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579200832] [2024-11-10 17:26:51,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:51,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:51,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:51,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:51,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:51,539 INFO L87 Difference]: Start difference. First operand 1304 states and 1623 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:51,606 INFO L93 Difference]: Finished difference Result 1266 states and 1536 transitions. [2024-11-10 17:26:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:26:51,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 17:26:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:51,609 INFO L225 Difference]: With dead ends: 1266 [2024-11-10 17:26:51,609 INFO L226 Difference]: Without dead ends: 1266 [2024-11-10 17:26:51,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:26:51,610 INFO L432 NwaCegarLoop]: 949 mSDtfsCounter, 48 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2820 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:51,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2820 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:26:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-11-10 17:26:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1266. [2024-11-10 17:26:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 858 states have (on average 1.7738927738927739) internal successors, (1522), 1256 states have internal predecessors, (1522), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 17:26:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1536 transitions. [2024-11-10 17:26:51,630 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1536 transitions. Word has length 19 [2024-11-10 17:26:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:51,630 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1536 transitions. [2024-11-10 17:26:51,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1536 transitions. [2024-11-10 17:26:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 17:26:51,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:51,633 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] [2024-11-10 17:26:51,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-10 17:26:51,833 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-10 17:26:51,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr508REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:51,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:51,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1234877913, now seen corresponding path program 1 times [2024-11-10 17:26:51,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:51,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821457243] [2024-11-10 17:26:51,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:51,835 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-10 17:26:51,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:51,836 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-10 17:26:51,837 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-10 17:26:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:51,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:26:51,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:52,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:52,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:52,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821457243] [2024-11-10 17:26:52,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821457243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:52,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:52,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:26:52,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676772843] [2024-11-10 17:26:52,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:52,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:26:52,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:52,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:26:52,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:52,005 INFO L87 Difference]: Start difference. First operand 1266 states and 1536 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:52,024 INFO L93 Difference]: Finished difference Result 1206 states and 1450 transitions. [2024-11-10 17:26:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:26:52,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-10 17:26:52,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:52,027 INFO L225 Difference]: With dead ends: 1206 [2024-11-10 17:26:52,027 INFO L226 Difference]: Without dead ends: 1206 [2024-11-10 17:26:52,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:26:52,028 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 71 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:52,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1768 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:26:52,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2024-11-10 17:26:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1206. [2024-11-10 17:26:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 822 states have (on average 1.7469586374695865) internal successors, (1436), 1196 states have internal predecessors, (1436), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 17:26:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1450 transitions. [2024-11-10 17:26:52,046 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1450 transitions. Word has length 21 [2024-11-10 17:26:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:52,048 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1450 transitions. [2024-11-10 17:26:52,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1450 transitions. [2024-11-10 17:26:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 17:26:52,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:52,049 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] [2024-11-10 17:26:52,055 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-10 17:26:52,249 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-10 17:26:52,249 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr484REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:52,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:52,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1306735973, now seen corresponding path program 1 times [2024-11-10 17:26:52,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:52,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399910702] [2024-11-10 17:26:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:52,256 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-10 17:26:52,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:52,257 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-10 17:26:52,258 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-10 17:26:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:52,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:26:52,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:52,436 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-10 17:26:52,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:52,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:52,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399910702] [2024-11-10 17:26:52,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399910702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:52,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:52,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:26:52,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632835601] [2024-11-10 17:26:52,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:52,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:52,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:52,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:52,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:52,439 INFO L87 Difference]: Start difference. First operand 1206 states and 1450 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:52,509 INFO L93 Difference]: Finished difference Result 1176 states and 1392 transitions. [2024-11-10 17:26:52,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:26:52,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-10 17:26:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:52,513 INFO L225 Difference]: With dead ends: 1176 [2024-11-10 17:26:52,514 INFO L226 Difference]: Without dead ends: 1176 [2024-11-10 17:26:52,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:26:52,515 INFO L432 NwaCegarLoop]: 871 mSDtfsCounter, 48 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:52,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2586 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:26:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2024-11-10 17:26:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1176. [2024-11-10 17:26:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 806 states have (on average 1.7096774193548387) internal successors, (1378), 1166 states have internal predecessors, (1378), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 17:26:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1392 transitions. [2024-11-10 17:26:52,536 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1392 transitions. Word has length 23 [2024-11-10 17:26:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:52,537 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1392 transitions. [2024-11-10 17:26:52,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1392 transitions. [2024-11-10 17:26:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 17:26:52,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:52,538 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-10 17:26:52,545 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-10 17:26:52,743 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-10 17:26:52,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr154REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:52,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash -418246763, now seen corresponding path program 1 times [2024-11-10 17:26:52,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:52,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757450539] [2024-11-10 17:26:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:52,745 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-10 17:26:52,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:52,747 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-10 17:26:52,747 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-10 17:26:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:52,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:26:52,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:52,885 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-10 17:26:52,960 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-10 17:26:52,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:52,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:52,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757450539] [2024-11-10 17:26:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757450539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:52,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:52,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:26:52,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390476008] [2024-11-10 17:26:52,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:52,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:52,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:52,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:52,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:52,962 INFO L87 Difference]: Start difference. First operand 1176 states and 1392 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:54,102 INFO L93 Difference]: Finished difference Result 1193 states and 1401 transitions. [2024-11-10 17:26:54,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:26:54,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-10 17:26:54,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:54,105 INFO L225 Difference]: With dead ends: 1193 [2024-11-10 17:26:54,105 INFO L226 Difference]: Without dead ends: 1193 [2024-11-10 17:26:54,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:26:54,106 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 791 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:54,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1072 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:26:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-10 17:26:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1172. [2024-11-10 17:26:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 806 states have (on average 1.694789081885856) internal successors, (1366), 1162 states have internal predecessors, (1366), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 17:26:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1380 transitions. [2024-11-10 17:26:54,120 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1380 transitions. Word has length 33 [2024-11-10 17:26:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:54,120 INFO L471 AbstractCegarLoop]: Abstraction has 1172 states and 1380 transitions. [2024-11-10 17:26:54,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1380 transitions. [2024-11-10 17:26:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 17:26:54,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:54,121 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-10 17:26:54,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-10 17:26:54,324 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-10 17:26:54,325 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:54,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:54,325 INFO L85 PathProgramCache]: Analyzing trace with hash -418246762, now seen corresponding path program 1 times [2024-11-10 17:26:54,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:54,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788385773] [2024-11-10 17:26:54,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:54,326 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-10 17:26:54,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:54,329 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-10 17:26:54,331 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-10 17:26:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:54,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:26:54,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:54,489 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-10 17:26:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:26:54,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:54,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788385773] [2024-11-10 17:26:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788385773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:54,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:26:54,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396560573] [2024-11-10 17:26:54,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:54,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:54,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:54,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:54,662 INFO L87 Difference]: Start difference. First operand 1172 states and 1380 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:56,283 INFO L93 Difference]: Finished difference Result 1668 states and 2000 transitions. [2024-11-10 17:26:56,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:26:56,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-10 17:26:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:56,287 INFO L225 Difference]: With dead ends: 1668 [2024-11-10 17:26:56,287 INFO L226 Difference]: Without dead ends: 1668 [2024-11-10 17:26:56,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:26:56,288 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 374 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:56,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1678 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:26:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2024-11-10 17:26:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1504. [2024-11-10 17:26:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1136 states have (on average 1.7191901408450705) internal successors, (1953), 1492 states have internal predecessors, (1953), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:26:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1971 transitions. [2024-11-10 17:26:56,306 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1971 transitions. Word has length 33 [2024-11-10 17:26:56,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:56,306 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1971 transitions. [2024-11-10 17:26:56,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1971 transitions. [2024-11-10 17:26:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 17:26:56,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:56,309 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-10 17:26:56,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-10 17:26:56,512 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-10 17:26:56,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr470REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:56,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:56,513 INFO L85 PathProgramCache]: Analyzing trace with hash -496887279, now seen corresponding path program 1 times [2024-11-10 17:26:56,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:56,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501145253] [2024-11-10 17:26:56,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:56,515 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-10 17:26:56,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:56,518 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-10 17:26:56,519 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-10 17:26:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:56,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:26:56,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:56,680 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-10 17:26:56,754 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-10 17:26:56,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:56,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:56,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501145253] [2024-11-10 17:26:56,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501145253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:56,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:56,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:26:56,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086545953] [2024-11-10 17:26:56,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:56,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:56,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:56,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:56,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:56,755 INFO L87 Difference]: Start difference. First operand 1504 states and 1971 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:58,204 INFO L93 Difference]: Finished difference Result 1971 states and 2562 transitions. [2024-11-10 17:26:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:26:58,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-10 17:26:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:58,212 INFO L225 Difference]: With dead ends: 1971 [2024-11-10 17:26:58,212 INFO L226 Difference]: Without dead ends: 1971 [2024-11-10 17:26:58,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:26:58,213 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 802 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:58,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1654 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:26:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2024-11-10 17:26:58,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1500. [2024-11-10 17:26:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1136 states have (on average 1.7121478873239437) internal successors, (1945), 1488 states have internal predecessors, (1945), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:26:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1963 transitions. [2024-11-10 17:26:58,233 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1963 transitions. Word has length 37 [2024-11-10 17:26:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:58,233 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1963 transitions. [2024-11-10 17:26:58,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:26:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1963 transitions. [2024-11-10 17:26:58,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 17:26:58,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:58,234 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-10 17:26:58,240 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-10 17:26:58,435 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-10 17:26:58,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr471REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:26:58,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:58,436 INFO L85 PathProgramCache]: Analyzing trace with hash -496887278, now seen corresponding path program 1 times [2024-11-10 17:26:58,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:26:58,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981745425] [2024-11-10 17:26:58,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:58,436 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-10 17:26:58,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:26:58,438 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-10 17:26:58,439 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-10 17:26:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:58,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:26:58,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:58,610 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-10 17:26:58,778 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-10 17:26:58,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:26:58,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:26:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981745425] [2024-11-10 17:26:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981745425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:58,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:58,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:26:58,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492019965] [2024-11-10 17:26:58,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:58,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:26:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:26:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:26:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:26:58,779 INFO L87 Difference]: Start difference. First operand 1500 states and 1963 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:00,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:00,534 INFO L93 Difference]: Finished difference Result 2033 states and 2588 transitions. [2024-11-10 17:27:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:27:00,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-10 17:27:00,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:00,540 INFO L225 Difference]: With dead ends: 2033 [2024-11-10 17:27:00,540 INFO L226 Difference]: Without dead ends: 2033 [2024-11-10 17:27:00,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:27:00,540 INFO L432 NwaCegarLoop]: 1104 mSDtfsCounter, 557 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:00,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 2207 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:27:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2024-11-10 17:27:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1496. [2024-11-10 17:27:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1136 states have (on average 1.705105633802817) internal successors, (1937), 1484 states have internal predecessors, (1937), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:27:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1955 transitions. [2024-11-10 17:27:00,572 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1955 transitions. Word has length 37 [2024-11-10 17:27:00,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:00,572 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 1955 transitions. [2024-11-10 17:27:00,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1955 transitions. [2024-11-10 17:27:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 17:27:00,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:00,574 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, 1, 1, 1, 1, 1] [2024-11-10 17:27:00,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-10 17:27:00,777 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-10 17:27:00,778 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:27:00,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:00,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1066335815, now seen corresponding path program 1 times [2024-11-10 17:27:00,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:27:00,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821411409] [2024-11-10 17:27:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:00,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:27:00,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:27:00,780 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-10 17:27:00,781 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-10 17:27:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:00,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:27:00,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:00,970 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-10 17:27:00,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:27:00,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:27:00,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821411409] [2024-11-10 17:27:00,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821411409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:00,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:00,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:27:00,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31157433] [2024-11-10 17:27:00,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:00,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:27:00,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:27:00,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:27:00,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:27:00,972 INFO L87 Difference]: Start difference. First operand 1496 states and 1955 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:01,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:01,026 INFO L93 Difference]: Finished difference Result 1466 states and 1905 transitions. [2024-11-10 17:27:01,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:27:01,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-10 17:27:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:01,031 INFO L225 Difference]: With dead ends: 1466 [2024-11-10 17:27:01,031 INFO L226 Difference]: Without dead ends: 1466 [2024-11-10 17:27:01,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:27:01,032 INFO L432 NwaCegarLoop]: 861 mSDtfsCounter, 27 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:01,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2545 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:27:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2024-11-10 17:27:01,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1466. [2024-11-10 17:27:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1106 states have (on average 1.7061482820976492) internal successors, (1887), 1454 states have internal predecessors, (1887), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:27:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1905 transitions. [2024-11-10 17:27:01,049 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1905 transitions. Word has length 52 [2024-11-10 17:27:01,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:01,050 INFO L471 AbstractCegarLoop]: Abstraction has 1466 states and 1905 transitions. [2024-11-10 17:27:01,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1905 transitions. [2024-11-10 17:27:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 17:27:01,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:01,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:01,057 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-10 17:27:01,252 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-10 17:27:01,252 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:27:01,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash 609840972, now seen corresponding path program 1 times [2024-11-10 17:27:01,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:27:01,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551549529] [2024-11-10 17:27:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:01,253 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-10 17:27:01,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:27:01,256 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-10 17:27:01,257 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-10 17:27:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:01,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:27:01,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:01,545 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-10 17:27:01,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:27:01,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:27:01,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551549529] [2024-11-10 17:27:01,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551549529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:01,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:01,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:27:01,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512353607] [2024-11-10 17:27:01,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:01,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:27:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:27:01,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:27:01,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:27:01,547 INFO L87 Difference]: Start difference. First operand 1466 states and 1905 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:01,601 INFO L93 Difference]: Finished difference Result 1454 states and 1885 transitions. [2024-11-10 17:27:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:27:01,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-10 17:27:01,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:01,609 INFO L225 Difference]: With dead ends: 1454 [2024-11-10 17:27:01,609 INFO L226 Difference]: Without dead ends: 1454 [2024-11-10 17:27:01,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:27:01,610 INFO L432 NwaCegarLoop]: 857 mSDtfsCounter, 21 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:01,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2539 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:27:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2024-11-10 17:27:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1454. [2024-11-10 17:27:01,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1094 states have (on average 1.706581352833638) internal successors, (1867), 1442 states have internal predecessors, (1867), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:27:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1885 transitions. [2024-11-10 17:27:01,630 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1885 transitions. Word has length 57 [2024-11-10 17:27:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:01,630 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 1885 transitions. [2024-11-10 17:27:01,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1885 transitions. [2024-11-10 17:27:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 17:27:01,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:01,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:01,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-10 17:27:01,831 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-10 17:27:01,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:27:01,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash -646203777, now seen corresponding path program 1 times [2024-11-10 17:27:01,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:27:01,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765080859] [2024-11-10 17:27:01,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:01,833 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-10 17:27:01,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:27:01,834 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-10 17:27:01,835 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-10 17:27:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:01,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:27:01,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:02,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:27:02,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:27:02,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765080859] [2024-11-10 17:27:02,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765080859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:02,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:02,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:27:02,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2769834] [2024-11-10 17:27:02,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:02,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:27:02,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:27:02,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:27:02,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:27:02,028 INFO L87 Difference]: Start difference. First operand 1454 states and 1885 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:02,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:02,100 INFO L93 Difference]: Finished difference Result 1233 states and 1322 transitions. [2024-11-10 17:27:02,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:27:02,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 17:27:02,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:02,107 INFO L225 Difference]: With dead ends: 1233 [2024-11-10 17:27:02,107 INFO L226 Difference]: Without dead ends: 1233 [2024-11-10 17:27:02,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:27:02,108 INFO L432 NwaCegarLoop]: 937 mSDtfsCounter, 109 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:02,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1738 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:27:02,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2024-11-10 17:27:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1072. [2024-11-10 17:27:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 714 states have (on average 1.596638655462185) internal successors, (1140), 1062 states have internal predecessors, (1140), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 17:27:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1154 transitions. [2024-11-10 17:27:02,127 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1154 transitions. Word has length 60 [2024-11-10 17:27:02,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:02,127 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1154 transitions. [2024-11-10 17:27:02,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1154 transitions. [2024-11-10 17:27:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 17:27:02,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:02,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:02,133 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-10 17:27:02,328 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-10 17:27:02,329 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:27:02,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:02,329 INFO L85 PathProgramCache]: Analyzing trace with hash -53087421, now seen corresponding path program 1 times [2024-11-10 17:27:02,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:27:02,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124321150] [2024-11-10 17:27:02,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:02,330 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-10 17:27:02,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:27:02,331 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-10 17:27:02,332 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-10 17:27:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:02,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 17:27:02,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:02,561 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:27:02,561 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:27:02,562 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:27:02,565 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 30 treesize of output 39 [2024-11-10 17:27:02,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 17:27:02,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-10 17:27:02,672 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-10 17:27:02,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:27:02,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:27:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124321150] [2024-11-10 17:27:02,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124321150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:02,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:02,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:27:02,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466521976] [2024-11-10 17:27:02,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:02,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:27:02,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:27:02,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:27:02,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:27:02,676 INFO L87 Difference]: Start difference. First operand 1072 states and 1154 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:02,922 INFO L93 Difference]: Finished difference Result 1760 states and 1878 transitions. [2024-11-10 17:27:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:27:02,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-10 17:27:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:02,926 INFO L225 Difference]: With dead ends: 1760 [2024-11-10 17:27:02,926 INFO L226 Difference]: Without dead ends: 1756 [2024-11-10 17:27:02,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:27:02,926 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 2407 mSDsluCounter, 2468 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2415 SdHoareTripleChecker+Valid, 3319 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:02,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2415 Valid, 3319 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:27:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2024-11-10 17:27:02,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1017. [2024-11-10 17:27:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 660 states have (on average 1.643939393939394) internal successors, (1085), 1008 states have internal predecessors, (1085), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:27:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1097 transitions. [2024-11-10 17:27:02,939 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1097 transitions. Word has length 63 [2024-11-10 17:27:02,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:02,939 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1097 transitions. [2024-11-10 17:27:02,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:02,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1097 transitions. [2024-11-10 17:27:02,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 17:27:02,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:02,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:27:02,947 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-10 17:27:03,141 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-10 17:27:03,141 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:27:03,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:03,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1786309612, now seen corresponding path program 1 times [2024-11-10 17:27:03,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:27:03,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478785310] [2024-11-10 17:27:03,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:03,142 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-10 17:27:03,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:27:03,143 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-10 17:27:03,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 (22)] Waiting until timeout for monitored process [2024-11-10 17:27:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:03,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:27:03,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:03,412 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-10 17:27:03,418 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-10 17:27:03,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:27:03,850 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-10 17:27:03,859 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:27:03,859 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-10 17:27:03,867 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-10 17:27:03,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:27:03,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:27:03,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478785310] [2024-11-10 17:27:03,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478785310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:03,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:03,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:27:03,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925160936] [2024-11-10 17:27:03,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:03,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:27:03,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:27:03,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:27:03,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:27:03,869 INFO L87 Difference]: Start difference. First operand 1017 states and 1097 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:05,300 INFO L93 Difference]: Finished difference Result 1362 states and 1466 transitions. [2024-11-10 17:27:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:27:05,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-10 17:27:05,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:05,304 INFO L225 Difference]: With dead ends: 1362 [2024-11-10 17:27:05,304 INFO L226 Difference]: Without dead ends: 1362 [2024-11-10 17:27:05,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:27:05,305 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 1778 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:05,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 476 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:27:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2024-11-10 17:27:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 940. [2024-11-10 17:27:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 621 states have (on average 1.5636070853462158) internal successors, (971), 931 states have internal predecessors, (971), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:27:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 983 transitions. [2024-11-10 17:27:05,329 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 983 transitions. Word has length 65 [2024-11-10 17:27:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:05,329 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 983 transitions. [2024-11-10 17:27:05,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 983 transitions. [2024-11-10 17:27:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 17:27:05,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:05,330 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, 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-10 17:27:05,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 (22)] Forceful destruction successful, exit code 0 [2024-11-10 17:27:05,530 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-10 17:27:05,530 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:27:05,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:05,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1028689135, now seen corresponding path program 1 times [2024-11-10 17:27:05,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:27:05,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120245741] [2024-11-10 17:27:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:05,532 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-10 17:27:05,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:27:05,535 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-10 17:27:05,536 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-10 17:27:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:05,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:27:05,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:05,819 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-10 17:27:05,828 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 19 treesize of output 1 [2024-11-10 17:27:05,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 17:27:05,851 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-10 17:27:05,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:27:05,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:27:05,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120245741] [2024-11-10 17:27:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120245741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:05,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:05,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:27:05,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341167140] [2024-11-10 17:27:05,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:05,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:27:05,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:27:05,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:27:05,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:27:05,853 INFO L87 Difference]: Start difference. First operand 940 states and 983 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:07,132 INFO L93 Difference]: Finished difference Result 939 states and 982 transitions. [2024-11-10 17:27:07,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:27:07,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-10 17:27:07,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:07,134 INFO L225 Difference]: With dead ends: 939 [2024-11-10 17:27:07,134 INFO L226 Difference]: Without dead ends: 939 [2024-11-10 17:27:07,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:27:07,134 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 2 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:07,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2166 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:27:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-11-10 17:27:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 939. [2024-11-10 17:27:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 621 states have (on average 1.5619967793880838) internal successors, (970), 930 states have internal predecessors, (970), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:27:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 982 transitions. [2024-11-10 17:27:07,144 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 982 transitions. Word has length 70 [2024-11-10 17:27:07,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:07,145 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 982 transitions. [2024-11-10 17:27:07,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 982 transitions. [2024-11-10 17:27:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 17:27:07,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:07,146 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, 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-10 17:27:07,155 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 (23)] Forceful destruction successful, exit code 0 [2024-11-10 17:27:07,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10 17:27:07,346 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:27:07,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:07,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1028689136, now seen corresponding path program 1 times [2024-11-10 17:27:07,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:27:07,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584558747] [2024-11-10 17:27:07,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:07,348 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-10 17:27:07,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:27:07,349 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:27:07,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-10 17:27:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:07,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 17:27:07,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:07,600 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-10 17:27:07,615 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 19 treesize of output 1 [2024-11-10 17:27:07,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:27:07,661 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 21 treesize of output 9 [2024-11-10 17:27:07,676 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-10 17:27:07,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:27:07,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:27:07,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584558747] [2024-11-10 17:27:07,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584558747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:07,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:07,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:27:07,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922524140] [2024-11-10 17:27:07,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:07,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:27:07,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:27:07,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:27:07,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:27:07,678 INFO L87 Difference]: Start difference. First operand 939 states and 982 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:09,239 INFO L93 Difference]: Finished difference Result 938 states and 981 transitions. [2024-11-10 17:27:09,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:27:09,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-10 17:27:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:09,241 INFO L225 Difference]: With dead ends: 938 [2024-11-10 17:27:09,241 INFO L226 Difference]: Without dead ends: 938 [2024-11-10 17:27:09,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:27:09,242 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 1 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:09,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2202 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 17:27:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-11-10 17:27:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2024-11-10 17:27:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 620 states have (on average 1.5629032258064517) internal successors, (969), 929 states have internal predecessors, (969), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:27:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 981 transitions. [2024-11-10 17:27:09,249 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 981 transitions. Word has length 70 [2024-11-10 17:27:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:09,249 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 981 transitions. [2024-11-10 17:27:09,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:27:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 981 transitions. [2024-11-10 17:27:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 17:27:09,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:09,250 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, 1, 1, 1, 1, 1, 1, 1, 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-10 17:27:09,257 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 (24)] Forceful destruction successful, exit code 0 [2024-11-10 17:27:09,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:27:09,451 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:27:09,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1991441068, now seen corresponding path program 1 times [2024-11-10 17:27:09,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:27:09,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799720431] [2024-11-10 17:27:09,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:09,452 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-10 17:27:09,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:27:09,453 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:27:09,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-10 17:27:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:09,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:27:09,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:09,719 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-10 17:27:09,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:27:09,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:27:09,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799720431] [2024-11-10 17:27:09,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799720431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:27:09,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:27:09,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:27:09,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153089445] [2024-11-10 17:27:09,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:27:09,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:27:09,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:27:09,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:27:09,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:27:09,721 INFO L87 Difference]: Start difference. First operand 938 states and 981 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-10 17:27:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:09,745 INFO L93 Difference]: Finished difference Result 941 states and 985 transitions. [2024-11-10 17:27:09,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:27:09,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 78 [2024-11-10 17:27:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:09,750 INFO L225 Difference]: With dead ends: 941 [2024-11-10 17:27:09,750 INFO L226 Difference]: Without dead ends: 941 [2024-11-10 17:27:09,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 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-10 17:27:09,750 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 0 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2485 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:09,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2485 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:27:09,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-10 17:27:09,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 941. [2024-11-10 17:27:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 622 states have (on average 1.562700964630225) internal successors, (972), 932 states have internal predecessors, (972), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-10 17:27:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 985 transitions. [2024-11-10 17:27:09,763 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 985 transitions. Word has length 78 [2024-11-10 17:27:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:09,763 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 985 transitions. [2024-11-10 17:27:09,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-10 17:27:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 985 transitions. [2024-11-10 17:27:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 17:27:09,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:09,764 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 17:27:09,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-10 17:27:09,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:27:09,965 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:27:09,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:09,966 INFO L85 PathProgramCache]: Analyzing trace with hash -484793166, now seen corresponding path program 1 times [2024-11-10 17:27:09,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:27:09,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332772430] [2024-11-10 17:27:09,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:27:09,966 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-10 17:27:09,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:27:09,968 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:27:09,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-10 17:27:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:27:10,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:27:10,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:10,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:27:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:10,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:27:10,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332772430] [2024-11-10 17:27:10,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332772430] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:27:10,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:27:10,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 17:27:10,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340215962] [2024-11-10 17:27:10,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:27:10,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 17:27:10,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:27:10,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 17:27:10,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:27:10,320 INFO L87 Difference]: Start difference. First operand 941 states and 985 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:10,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:10,440 INFO L93 Difference]: Finished difference Result 953 states and 1002 transitions. [2024-11-10 17:27:10,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:27:10,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 79 [2024-11-10 17:27:10,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:10,443 INFO L225 Difference]: With dead ends: 953 [2024-11-10 17:27:10,443 INFO L226 Difference]: Without dead ends: 953 [2024-11-10 17:27:10,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-10 17:27:10,444 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 7 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:10,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2487 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:27:10,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2024-11-10 17:27:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 951. [2024-11-10 17:27:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 631 states have (on average 1.5641838351822503) internal successors, (987), 941 states have internal predecessors, (987), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-10 17:27:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1000 transitions. [2024-11-10 17:27:10,453 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1000 transitions. Word has length 79 [2024-11-10 17:27:10,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:10,453 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1000 transitions. [2024-11-10 17:27:10,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:10,454 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1000 transitions. [2024-11-10 17:27:10,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 17:27:10,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:10,454 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 17:27:10,462 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 (26)] Forceful destruction successful, exit code 0 [2024-11-10 17:27:10,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:27:10,655 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:27:10,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash 676351020, now seen corresponding path program 2 times [2024-11-10 17:27:10,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:27:10,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329998212] [2024-11-10 17:27:10,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:27:10,656 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-10 17:27:10,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:27:10,657 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:27:10,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-10 17:27:11,056 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 17:27:11,056 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:27:11,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:27:11,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:11,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:27:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:11,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:27:11,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329998212] [2024-11-10 17:27:11,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329998212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:27:11,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:27:11,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 17:27:11,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818321008] [2024-11-10 17:27:11,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:27:11,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:27:11,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:27:11,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:27:11,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:27:11,218 INFO L87 Difference]: Start difference. First operand 951 states and 1000 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:11,582 INFO L93 Difference]: Finished difference Result 966 states and 1022 transitions. [2024-11-10 17:27:11,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 17:27:11,583 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2024-11-10 17:27:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:11,585 INFO L225 Difference]: With dead ends: 966 [2024-11-10 17:27:11,585 INFO L226 Difference]: Without dead ends: 962 [2024-11-10 17:27:11,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 17:27:11,585 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 14 mSDsluCounter, 5787 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6617 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:11,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6617 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:27:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-10 17:27:11,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 960. [2024-11-10 17:27:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 640 states have (on average 1.5609375) internal successors, (999), 950 states have internal predecessors, (999), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-10 17:27:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1012 transitions. [2024-11-10 17:27:11,595 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1012 transitions. Word has length 82 [2024-11-10 17:27:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:11,596 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1012 transitions. [2024-11-10 17:27:11,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1012 transitions. [2024-11-10 17:27:11,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 17:27:11,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:11,597 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 17:27:11,607 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 (27)] Forceful destruction successful, exit code 0 [2024-11-10 17:27:11,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:27:11,798 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:27:11,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:11,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1458658924, now seen corresponding path program 3 times [2024-11-10 17:27:11,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:27:11,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452790100] [2024-11-10 17:27:11,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:27:11,799 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-10 17:27:11,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:27:11,800 INFO L229 MonitoredProcess]: Starting monitored process 28 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-10 17:27:11,801 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 (28)] Waiting until timeout for monitored process [2024-11-10 17:27:12,371 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 17:27:12,372 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:27:12,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 17:27:12,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:12,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:27:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:13,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:27:13,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452790100] [2024-11-10 17:27:13,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452790100] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:27:13,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:27:13,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 17:27:13,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098486140] [2024-11-10 17:27:13,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:27:13,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:27:13,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:27:13,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:27:13,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 17:27:13,011 INFO L87 Difference]: Start difference. First operand 960 states and 1012 transitions. Second operand has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:14,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:14,212 INFO L93 Difference]: Finished difference Result 984 states and 1051 transitions. [2024-11-10 17:27:14,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 17:27:14,213 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-10 17:27:14,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:14,215 INFO L225 Difference]: With dead ends: 984 [2024-11-10 17:27:14,215 INFO L226 Difference]: Without dead ends: 978 [2024-11-10 17:27:14,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 17:27:14,216 INFO L432 NwaCegarLoop]: 831 mSDtfsCounter, 19 mSDsluCounter, 9109 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 9940 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:14,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 9940 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 17:27:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-10 17:27:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2024-11-10 17:27:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 658 states have (on average 1.553191489361702) internal successors, (1022), 968 states have internal predecessors, (1022), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-10 17:27:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1035 transitions. [2024-11-10 17:27:14,235 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1035 transitions. Word has length 88 [2024-11-10 17:27:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:14,236 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1035 transitions. [2024-11-10 17:27:14,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1035 transitions. [2024-11-10 17:27:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 17:27:14,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:14,237 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 17:27:14,248 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 (28)] Ended with exit code 0 [2024-11-10 17:27:14,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10 17:27:14,438 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:27:14,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:14,438 INFO L85 PathProgramCache]: Analyzing trace with hash -823954708, now seen corresponding path program 4 times [2024-11-10 17:27:14,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:27:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018879017] [2024-11-10 17:27:14,439 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:27:14,439 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-10 17:27:14,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:27:14,440 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:27:14,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-10 17:27:14,882 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:27:14,882 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:27:14,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 17:27:14,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:15,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:27:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:27:16,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:27:16,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018879017] [2024-11-10 17:27:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018879017] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:27:16,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:27:16,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 17:27:16,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917556616] [2024-11-10 17:27:16,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:27:16,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 17:27:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:27:16,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 17:27:16,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 17:27:16,439 INFO L87 Difference]: Start difference. First operand 978 states and 1035 transitions. Second operand has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:20,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:27:20,792 INFO L93 Difference]: Finished difference Result 1018 states and 1107 transitions. [2024-11-10 17:27:20,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 17:27:20,793 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-10 17:27:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:27:20,795 INFO L225 Difference]: With dead ends: 1018 [2024-11-10 17:27:20,795 INFO L226 Difference]: Without dead ends: 1014 [2024-11-10 17:27:20,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 17:27:20,797 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 44 mSDsluCounter, 21498 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 22328 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:27:20,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 22328 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:27:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-10 17:27:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1012. [2024-11-10 17:27:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 692 states have (on average 1.5433526011560694) internal successors, (1068), 1002 states have internal predecessors, (1068), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-10 17:27:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1081 transitions. [2024-11-10 17:27:20,810 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1081 transitions. Word has length 100 [2024-11-10 17:27:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:27:20,810 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1081 transitions. [2024-11-10 17:27:20,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:27:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1081 transitions. [2024-11-10 17:27:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 17:27:20,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:27:20,812 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 17:27:20,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-10 17:27:21,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:27:21,013 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:27:21,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:27:21,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1353696468, now seen corresponding path program 5 times [2024-11-10 17:27:21,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:27:21,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622469604] [2024-11-10 17:27:21,015 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:27:21,015 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-10 17:27:21,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:27:21,018 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:27:21,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-10 17:27:22,136 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-10 17:27:22,136 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:27:22,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-10 17:27:22,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:27:22,166 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-10 17:27:22,259 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-10 17:27:22,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-10 17:27:22,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:27:22,341 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 24 treesize of output 12 [2024-11-10 17:27:23,120 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:27:23,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-10 17:27:23,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-10 17:27:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 17:27:23,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:27:23,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:27:23,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622469604] [2024-11-10 17:27:23,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622469604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:27:23,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1359530564] [2024-11-10 17:27:23,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:27:23,502 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 17:27:23,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 17:27:23,503 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 17:27:23,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process