./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:56:23,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:56:23,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:56:23,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:56:23,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:56:23,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:56:23,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:56:23,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:56:23,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:56:23,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:56:23,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:56:23,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:56:23,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:56:23,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:56:23,178 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:56:23,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:56:23,181 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:56:23,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:56:23,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:56:23,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:56:23,182 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:56:23,182 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:56:23,183 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:56:23,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:56:23,187 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:56:23,187 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:56:23,188 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:56:23,188 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:56:23,188 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:56:23,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:56:23,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:56:23,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:56:23,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:56:23,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:56:23,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:56:23,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:56:23,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:56:23,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:56:23,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:56:23,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:56:23,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:56:23,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:56:23,193 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-17 02:56:23,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:56:23,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:56:23,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:56:23,455 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:56:23,455 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:56:23,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-17 02:56:24,810 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:56:25,092 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:56:25,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-17 02:56:25,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2d41683/b5e333909c734db8a295283a6656101b/FLAGb41928e00 [2024-11-17 02:56:25,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2d41683/b5e333909c734db8a295283a6656101b [2024-11-17 02:56:25,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:56:25,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:56:25,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:56:25,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:56:25,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:56:25,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:56:25" (1/1) ... [2024-11-17 02:56:25,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@418bc115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:25, skipping insertion in model container [2024-11-17 02:56:25,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:56:25" (1/1) ... [2024-11-17 02:56:25,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:56:25,651 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,694 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,700 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,705 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,720 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,767 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,767 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,773 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,774 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,776 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,779 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,780 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,783 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,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-17 02:56:25,788 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:25,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:56:25,822 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-17 02:56:25,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6deb2e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:25, skipping insertion in model container [2024-11-17 02:56:25,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:56:25,826 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 02:56:25,828 INFO L158 Benchmark]: Toolchain (without parser) took 694.80ms. Allocated memory is still 163.6MB. Free memory was 86.1MB in the beginning and 62.2MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-17 02:56:25,828 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 02:56:25,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 692.70ms. Allocated memory is still 163.6MB. Free memory was 85.7MB in the beginning and 62.6MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-17 02:56:25,831 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.13ms. Allocated memory is still 163.6MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 692.70ms. Allocated memory is still 163.6MB. Free memory was 85.7MB in the beginning and 62.6MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 831]: 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_SAX_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:56:27,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:56:28,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 02:56:28,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:56:28,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:56:28,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:56:28,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:56:28,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:56:28,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:56:28,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:56:28,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:56:28,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:56:28,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:56:28,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:56:28,077 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:56:28,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:56:28,078 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:56:28,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:56:28,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:56:28,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:56:28,079 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:56:28,082 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:56:28,082 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:56:28,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:56:28,083 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:56:28,083 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 02:56:28,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:56:28,084 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 02:56:28,084 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:56:28,085 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:56:28,086 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:56:28,086 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:56:28,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:56:28,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:56:28,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:56:28,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:56:28,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:56:28,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:56:28,088 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 02:56:28,088 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 02:56:28,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:56:28,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:56:28,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:56:28,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:56:28,089 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-17 02:56:28,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:56:28,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:56:28,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:56:28,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:56:28,464 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:56:28,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-17 02:56:29,980 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:56:30,326 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:56:30,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-17 02:56:30,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf135ebd/ca5dea84c10e420daa5e2a3f6e0020ed/FLAG3291c0ffd [2024-11-17 02:56:30,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf135ebd/ca5dea84c10e420daa5e2a3f6e0020ed [2024-11-17 02:56:30,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:56:30,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:56:30,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:56:30,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:56:30,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:56:30,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:56:30" (1/1) ... [2024-11-17 02:56:30,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b113659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:30, skipping insertion in model container [2024-11-17 02:56:30,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:56:30" (1/1) ... [2024-11-17 02:56:30,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:56: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-17 02:56:30,875 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:30,879 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:30,884 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:30,893 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:30,963 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:30,965 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:30,968 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:30,968 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:30,970 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:30,973 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:30,974 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:30,975 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:30,976 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56: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-17 02:56:30,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:56:31,008 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 02:56:31,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:56:31,054 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,067 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,069 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,072 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,076 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,108 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,109 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,111 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,112 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,113 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,116 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,117 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,117 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,120 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,123 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:56:31,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:56:31,134 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:56:31,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:56:31,272 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:56:31,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31 WrapperNode [2024-11-17 02:56:31,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:56:31,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:56:31,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:56:31,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:56:31,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31" (1/1) ... [2024-11-17 02:56:31,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31" (1/1) ... [2024-11-17 02:56:31,368 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1024 [2024-11-17 02:56:31,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:56:31,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:56:31,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:56:31,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:56:31,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31" (1/1) ... [2024-11-17 02:56:31,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31" (1/1) ... [2024-11-17 02:56:31,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31" (1/1) ... [2024-11-17 02:56:31,493 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 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, 50, 4]. [2024-11-17 02:56:31,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31" (1/1) ... [2024-11-17 02:56:31,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31" (1/1) ... [2024-11-17 02:56:31,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31" (1/1) ... [2024-11-17 02:56:31,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31" (1/1) ... [2024-11-17 02:56:31,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31" (1/1) ... [2024-11-17 02:56:31,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31" (1/1) ... [2024-11-17 02:56:31,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:56:31,583 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:56:31,583 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:56:31,583 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:56:31,584 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31" (1/1) ... [2024-11-17 02:56:31,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:56:31,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:56:31,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 02:56:31,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 02:56:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 02:56:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 02:56:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 02:56:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 02:56:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 02:56:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 02:56:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 02:56:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 02:56:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 02:56:31,692 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 02:56:31,693 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 02:56:31,693 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 02:56:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 02:56:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:56:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:56:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 02:56:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 02:56:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 02:56:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 02:56:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:56:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 02:56:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 02:56:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 02:56:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:56:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:56:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:56:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:56:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 02:56:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:56:31,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:56:31,942 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:56:31,944 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:56:35,367 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: 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-17 02:56:35,508 INFO L? ?]: Removed 1086 outVars from TransFormulas that were not future-live. [2024-11-17 02:56:35,509 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:56:35,542 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:56:35,543 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 02:56:35,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:56:35 BoogieIcfgContainer [2024-11-17 02:56:35,544 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:56:35,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:56:35,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:56:35,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:56:35,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:56:30" (1/3) ... [2024-11-17 02:56:35,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39675635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:56:35, skipping insertion in model container [2024-11-17 02:56:35,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:56:31" (2/3) ... [2024-11-17 02:56:35,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39675635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:56:35, skipping insertion in model container [2024-11-17 02:56:35,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:56:35" (3/3) ... [2024-11-17 02:56:35,552 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-2.i [2024-11-17 02:56:35,567 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:56:35,568 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 525 error locations. [2024-11-17 02:56:35,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:56:35,647 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;@72a12f08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:56:35,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-11-17 02:56:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 1086 states, 559 states have (on average 2.1592128801431127) internal successors, (1207), 1081 states have internal predecessors, (1207), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 02:56:35,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:35,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 02:56:35,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:35,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash 38571324, now seen corresponding path program 1 times [2024-11-17 02:56:35,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:35,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238012823] [2024-11-17 02:56:35,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:35,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:35,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:35,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:35,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 02:56:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:35,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:56:35,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:35,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:56:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:35,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:35,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:35,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238012823] [2024-11-17 02:56:35,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238012823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:35,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:35,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:56:35,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237316659] [2024-11-17 02:56:35,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:35,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:56:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:35,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:56:35,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:35,948 INFO L87 Difference]: Start difference. First operand has 1086 states, 559 states have (on average 2.1592128801431127) internal successors, (1207), 1081 states have internal predecessors, (1207), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-17 02:56:37,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:37,426 INFO L93 Difference]: Finished difference Result 1257 states and 1325 transitions. [2024-11-17 02:56:37,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:56:37,428 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-17 02:56:37,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:37,443 INFO L225 Difference]: With dead ends: 1257 [2024-11-17 02:56:37,443 INFO L226 Difference]: Without dead ends: 1254 [2024-11-17 02:56:37,445 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-17 02:56:37,447 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 991 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:37,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 808 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:56:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-11-17 02:56:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1069. [2024-11-17 02:56:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 559 states have (on average 2.007155635062612) internal successors, (1122), 1064 states have internal predecessors, (1122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:37,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1128 transitions. [2024-11-17 02:56:37,535 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1128 transitions. Word has length 4 [2024-11-17 02:56:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:37,536 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1128 transitions. [2024-11-17 02:56:37,536 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-17 02:56:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1128 transitions. [2024-11-17 02:56:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 02:56:37,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:37,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 02:56:37,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-17 02:56:37,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:37,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr524REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:37,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:37,741 INFO L85 PathProgramCache]: Analyzing trace with hash 38571325, now seen corresponding path program 1 times [2024-11-17 02:56:37,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:37,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295598439] [2024-11-17 02:56:37,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:37,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:37,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:37,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:37,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 (3)] Waiting until timeout for monitored process [2024-11-17 02:56:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:37,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:56:37,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:37,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:56:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:37,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:37,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:37,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295598439] [2024-11-17 02:56:37,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295598439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:37,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:37,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:56:37,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292905418] [2024-11-17 02:56:37,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:37,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:56:37,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:37,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:56:37,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:37,910 INFO L87 Difference]: Start difference. First operand 1069 states and 1128 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-17 02:56:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:39,794 INFO L93 Difference]: Finished difference Result 1495 states and 1586 transitions. [2024-11-17 02:56:39,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:56:39,794 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-17 02:56:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:39,800 INFO L225 Difference]: With dead ends: 1495 [2024-11-17 02:56:39,801 INFO L226 Difference]: Without dead ends: 1495 [2024-11-17 02:56:39,801 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-17 02:56:39,803 INFO L432 NwaCegarLoop]: 928 mSDtfsCounter, 458 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:39,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1531 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-17 02:56:39,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-17 02:56:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1202. [2024-11-17 02:56:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 693 states have (on average 1.9610389610389611) internal successors, (1359), 1197 states have internal predecessors, (1359), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1365 transitions. [2024-11-17 02:56:39,851 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1365 transitions. Word has length 4 [2024-11-17 02:56:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:39,851 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1365 transitions. [2024-11-17 02:56:39,851 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-17 02:56:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1365 transitions. [2024-11-17 02:56:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 02:56:39,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:39,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 02:56:39,856 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-17 02:56:40,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:40,053 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-17 02:56:40,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:40,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1195672931, now seen corresponding path program 1 times [2024-11-17 02:56:40,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:40,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820618363] [2024-11-17 02:56:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:40,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:40,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:40,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:40,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 02:56:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:40,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:56:40,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:40,204 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-17 02:56:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:40,216 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:40,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:40,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820618363] [2024-11-17 02:56:40,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820618363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:40,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:40,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:40,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125812214] [2024-11-17 02:56:40,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:40,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:40,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:40,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:40,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 02:56:40,219 INFO L87 Difference]: Start difference. First operand 1202 states and 1365 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-17 02:56:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:41,907 INFO L93 Difference]: Finished difference Result 1481 states and 1570 transitions. [2024-11-17 02:56:41,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:56:41,907 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-17 02:56:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:41,912 INFO L225 Difference]: With dead ends: 1481 [2024-11-17 02:56:41,913 INFO L226 Difference]: Without dead ends: 1479 [2024-11-17 02:56:41,913 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-17 02:56:41,914 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 440 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1560 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:41,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1525 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 718 Invalid, 0 Unknown, 1560 Unchecked, 1.6s Time] [2024-11-17 02:56:41,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2024-11-17 02:56:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1202. [2024-11-17 02:56:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 693 states have (on average 1.9595959595959596) internal successors, (1358), 1197 states have internal predecessors, (1358), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1364 transitions. [2024-11-17 02:56:41,939 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1364 transitions. Word has length 5 [2024-11-17 02:56:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:41,939 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1364 transitions. [2024-11-17 02:56:41,939 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-17 02:56:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1364 transitions. [2024-11-17 02:56:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:56:41,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:41,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:41,944 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-17 02:56:42,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:42,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr520REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:42,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:42,144 INFO L85 PathProgramCache]: Analyzing trace with hash -767703104, now seen corresponding path program 1 times [2024-11-17 02:56:42,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:42,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142342543] [2024-11-17 02:56:42,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:42,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:42,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:42,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:42,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 02:56:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:42,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 02:56:42,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:42,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:56:42,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:56:42,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:56:42,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 02:56:42,421 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:56:42,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-17 02:56:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:42,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:42,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:42,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142342543] [2024-11-17 02:56:42,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142342543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:42,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:42,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:42,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137171432] [2024-11-17 02:56:42,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:42,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:42,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:42,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:42,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:56:42,457 INFO L87 Difference]: Start difference. First operand 1202 states and 1364 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-17 02:56:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:44,774 INFO L93 Difference]: Finished difference Result 1376 states and 1546 transitions. [2024-11-17 02:56:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:56:44,774 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-17 02:56:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:44,778 INFO L225 Difference]: With dead ends: 1376 [2024-11-17 02:56:44,779 INFO L226 Difference]: Without dead ends: 1376 [2024-11-17 02:56:44,779 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-17 02:56:44,780 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 1280 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:44,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 478 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-17 02:56:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-17 02:56:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1057. [2024-11-17 02:56:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 559 states have (on average 1.9821109123434706) internal successors, (1108), 1052 states have internal predecessors, (1108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1114 transitions. [2024-11-17 02:56:44,800 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1114 transitions. Word has length 9 [2024-11-17 02:56:44,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:44,800 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1114 transitions. [2024-11-17 02:56:44,800 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-17 02:56:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1114 transitions. [2024-11-17 02:56:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 02:56:44,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:44,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:44,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 02:56:45,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:45,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:45,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1971008690, now seen corresponding path program 1 times [2024-11-17 02:56:45,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:45,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332612842] [2024-11-17 02:56:45,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:45,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:45,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:45,008 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:45,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 02:56:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:45,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:56:45,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:45,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:56:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:45,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:45,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332612842] [2024-11-17 02:56:45,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332612842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:45,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:45,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:56:45,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980782018] [2024-11-17 02:56:45,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:45,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:56:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:45,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:56:45,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:45,150 INFO L87 Difference]: Start difference. First operand 1057 states and 1114 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-17 02:56:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:46,309 INFO L93 Difference]: Finished difference Result 1230 states and 1308 transitions. [2024-11-17 02:56:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:56:46,310 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-17 02:56:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:46,313 INFO L225 Difference]: With dead ends: 1230 [2024-11-17 02:56:46,313 INFO L226 Difference]: Without dead ends: 1230 [2024-11-17 02:56:46,314 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-17 02:56:46,314 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 766 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:46,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1161 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:56:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-11-17 02:56:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1010. [2024-11-17 02:56:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 559 states have (on average 1.8980322003577819) internal successors, (1061), 1005 states have internal predecessors, (1061), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1067 transitions. [2024-11-17 02:56:46,349 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1067 transitions. Word has length 10 [2024-11-17 02:56:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:46,350 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1067 transitions. [2024-11-17 02:56:46,350 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-17 02:56:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1067 transitions. [2024-11-17 02:56:46,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 02:56:46,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:46,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:46,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 02:56:46,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:46,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:46,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1971008691, now seen corresponding path program 1 times [2024-11-17 02:56:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:46,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56863574] [2024-11-17 02:56:46,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:46,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:46,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:46,556 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:46,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 02:56:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:46,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:56:46,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:46,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:56:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:46,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:46,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:46,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56863574] [2024-11-17 02:56:46,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56863574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:46,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:46,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:56:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147368593] [2024-11-17 02:56:46,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:46,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:56:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:46,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:56:46,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:46,728 INFO L87 Difference]: Start difference. First operand 1010 states and 1067 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-17 02:56:48,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:48,286 INFO L93 Difference]: Finished difference Result 1308 states and 1389 transitions. [2024-11-17 02:56:48,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:56:48,286 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-17 02:56:48,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:48,290 INFO L225 Difference]: With dead ends: 1308 [2024-11-17 02:56:48,290 INFO L226 Difference]: Without dead ends: 1308 [2024-11-17 02:56:48,290 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-17 02:56:48,291 INFO L432 NwaCegarLoop]: 1076 mSDtfsCounter, 513 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:48,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1517 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:56:48,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2024-11-17 02:56:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1039. [2024-11-17 02:56:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 598 states have (on average 1.8846153846153846) internal successors, (1127), 1034 states have internal predecessors, (1127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1133 transitions. [2024-11-17 02:56:48,313 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1133 transitions. Word has length 10 [2024-11-17 02:56:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:48,314 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1133 transitions. [2024-11-17 02:56:48,314 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-17 02:56:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1133 transitions. [2024-11-17 02:56:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 02:56:48,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:48,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:48,322 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-17 02:56:48,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:48,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:48,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1422651079, now seen corresponding path program 1 times [2024-11-17 02:56:48,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:48,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72949373] [2024-11-17 02:56:48,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:48,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:48,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:48,526 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:48,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 02:56:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:48,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:56:48,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:48,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:48,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:48,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72949373] [2024-11-17 02:56:48,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72949373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:48,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:48,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:48,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600031736] [2024-11-17 02:56:48,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:48,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:56:48,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:48,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:56:48,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:48,744 INFO L87 Difference]: Start difference. First operand 1039 states and 1133 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-17 02:56:48,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:48,897 INFO L93 Difference]: Finished difference Result 1490 states and 1639 transitions. [2024-11-17 02:56:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:56:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-11-17 02:56:48,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:48,902 INFO L225 Difference]: With dead ends: 1490 [2024-11-17 02:56:48,902 INFO L226 Difference]: Without dead ends: 1490 [2024-11-17 02:56:48,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-17 02:56:48,903 INFO L432 NwaCegarLoop]: 1119 mSDtfsCounter, 475 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:48,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 2083 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:56:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2024-11-17 02:56:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1218. [2024-11-17 02:56:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 777 states have (on average 1.833976833976834) internal successors, (1425), 1213 states have internal predecessors, (1425), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1431 transitions. [2024-11-17 02:56:48,923 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1431 transitions. Word has length 14 [2024-11-17 02:56:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:48,924 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1431 transitions. [2024-11-17 02:56:48,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-17 02:56:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1431 transitions. [2024-11-17 02:56:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 02:56:48,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:48,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:48,931 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-17 02:56:49,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:49,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr193REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:49,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:49,129 INFO L85 PathProgramCache]: Analyzing trace with hash 586733750, now seen corresponding path program 1 times [2024-11-17 02:56:49,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:49,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452224704] [2024-11-17 02:56:49,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:49,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:49,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:49,132 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:49,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 02:56:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:49,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 02:56:49,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:49,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:49,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:49,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452224704] [2024-11-17 02:56:49,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452224704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:49,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:49,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:49,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314648488] [2024-11-17 02:56:49,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:49,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:56:49,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:49,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:56:49,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:49,266 INFO L87 Difference]: Start difference. First operand 1218 states and 1431 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-17 02:56:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:49,297 INFO L93 Difference]: Finished difference Result 1158 states and 1345 transitions. [2024-11-17 02:56:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:56:49,298 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-17 02:56:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:49,301 INFO L225 Difference]: With dead ends: 1158 [2024-11-17 02:56:49,302 INFO L226 Difference]: Without dead ends: 1158 [2024-11-17 02:56:49,302 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-17 02:56:49,302 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-17 02:56:49,303 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-17 02:56:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-17 02:56:49,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2024-11-17 02:56:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 741 states have (on average 1.8070175438596492) internal successors, (1339), 1153 states have internal predecessors, (1339), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1345 transitions. [2024-11-17 02:56:49,319 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1345 transitions. Word has length 17 [2024-11-17 02:56:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:49,320 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1345 transitions. [2024-11-17 02:56:49,320 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-17 02:56:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1345 transitions. [2024-11-17 02:56:49,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 02:56:49,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:49,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:49,326 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 (9)] Forceful destruction successful, exit code 0 [2024-11-17 02:56:49,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:49,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:49,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:49,523 INFO L85 PathProgramCache]: Analyzing trace with hash -495457004, now seen corresponding path program 1 times [2024-11-17 02:56:49,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:49,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927640188] [2024-11-17 02:56:49,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:49,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:49,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:49,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:49,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 02:56:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:49,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:56:49,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:49,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:49,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:49,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927640188] [2024-11-17 02:56:49,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927640188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:49,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:49,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:56:49,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764841357] [2024-11-17 02:56:49,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:49,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:49,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:49,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:49,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:56:49,733 INFO L87 Difference]: Start difference. First operand 1158 states and 1345 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-17 02:56:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:50,142 INFO L93 Difference]: Finished difference Result 1409 states and 1556 transitions. [2024-11-17 02:56:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:56:50,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-17 02:56:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:50,146 INFO L225 Difference]: With dead ends: 1409 [2024-11-17 02:56:50,146 INFO L226 Difference]: Without dead ends: 1409 [2024-11-17 02:56:50,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-17 02:56:50,147 INFO L432 NwaCegarLoop]: 1075 mSDtfsCounter, 436 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:50,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 2965 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 02:56:50,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-11-17 02:56:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1161. [2024-11-17 02:56:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 744 states have (on average 1.803763440860215) internal successors, (1342), 1156 states have internal predecessors, (1342), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1348 transitions. [2024-11-17 02:56:50,164 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1348 transitions. Word has length 18 [2024-11-17 02:56:50,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:50,165 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1348 transitions. [2024-11-17 02:56:50,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-17 02:56:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1348 transitions. [2024-11-17 02:56:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 02:56:50,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:50,166 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-17 02:56:50,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 02:56:50,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:50,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:50,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:50,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1820459967, now seen corresponding path program 1 times [2024-11-17 02:56:50,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:50,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828038814] [2024-11-17 02:56:50,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:50,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:50,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:50,371 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:50,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-17 02:56:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:50,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:56:50,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:50,601 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-17 02:56:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:50,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:50,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:50,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828038814] [2024-11-17 02:56:50,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828038814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:50,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:50,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:50,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790439724] [2024-11-17 02:56:50,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:50,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:50,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:50,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:50,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 02:56:50,613 INFO L87 Difference]: Start difference. First operand 1161 states and 1348 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) 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-17 02:56:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:51,522 INFO L93 Difference]: Finished difference Result 1263 states and 1461 transitions. [2024-11-17 02:56:51,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:56:51,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) 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-17 02:56:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:51,525 INFO L225 Difference]: With dead ends: 1263 [2024-11-17 02:56:51,525 INFO L226 Difference]: Without dead ends: 1255 [2024-11-17 02:56:51,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-17 02:56:51,526 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 103 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1123 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:51,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1536 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 473 Invalid, 0 Unknown, 1123 Unchecked, 0.9s Time] [2024-11-17 02:56:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-17 02:56:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1230. [2024-11-17 02:56:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 813 states have (on average 1.7773677736777367) internal successors, (1445), 1225 states have internal predecessors, (1445), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1451 transitions. [2024-11-17 02:56:51,542 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1451 transitions. Word has length 19 [2024-11-17 02:56:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:51,542 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1451 transitions. [2024-11-17 02:56:51,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) 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-17 02:56:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1451 transitions. [2024-11-17 02:56:51,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 02:56:51,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:51,544 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-17 02:56:51,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-17 02:56:51,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:51,745 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr169REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:51,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1210361418, now seen corresponding path program 1 times [2024-11-17 02:56:51,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:51,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716365200] [2024-11-17 02:56:51,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:51,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:51,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:51,748 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:51,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 02:56:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:51,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:56:51,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:51,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:51,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:51,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716365200] [2024-11-17 02:56:51,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716365200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:51,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:51,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:56:51,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192567231] [2024-11-17 02:56:51,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:51,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:51,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:51,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:51,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:56:51,879 INFO L87 Difference]: Start difference. First operand 1230 states and 1451 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-17 02:56:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:51,933 INFO L93 Difference]: Finished difference Result 1192 states and 1364 transitions. [2024-11-17 02:56:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:56:51,934 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-17 02:56:51,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:51,936 INFO L225 Difference]: With dead ends: 1192 [2024-11-17 02:56:51,937 INFO L226 Difference]: Without dead ends: 1192 [2024-11-17 02:56:51,937 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-17 02:56:51,937 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-17 02:56:51,938 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-17 02:56:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-11-17 02:56:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2024-11-17 02:56:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 789 states have (on average 1.721166032953105) internal successors, (1358), 1187 states have internal predecessors, (1358), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1364 transitions. [2024-11-17 02:56:51,955 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1364 transitions. Word has length 19 [2024-11-17 02:56:51,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:51,955 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1364 transitions. [2024-11-17 02:56:51,955 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-17 02:56:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1364 transitions. [2024-11-17 02:56:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 02:56:51,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:51,958 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-17 02:56:51,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-17 02:56:52,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:52,160 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:52,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:52,160 INFO L85 PathProgramCache]: Analyzing trace with hash -550509454, now seen corresponding path program 1 times [2024-11-17 02:56:52,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:52,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11544788] [2024-11-17 02:56:52,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:52,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:52,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:52,162 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:52,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-17 02:56:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:52,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 02:56:52,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:52,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:52,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:52,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11544788] [2024-11-17 02:56:52,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11544788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:52,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:52,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:52,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080184843] [2024-11-17 02:56:52,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:52,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:56:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:56:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:56:52,341 INFO L87 Difference]: Start difference. First operand 1192 states and 1364 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-17 02:56:52,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:52,369 INFO L93 Difference]: Finished difference Result 1132 states and 1278 transitions. [2024-11-17 02:56:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:56:52,370 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-17 02:56:52,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:52,373 INFO L225 Difference]: With dead ends: 1132 [2024-11-17 02:56:52,373 INFO L226 Difference]: Without dead ends: 1132 [2024-11-17 02:56:52,373 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-17 02:56:52,374 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-17 02:56:52,374 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-17 02:56:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-17 02:56:52,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2024-11-17 02:56:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 753 states have (on average 1.6892430278884463) internal successors, (1272), 1127 states have internal predecessors, (1272), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1278 transitions. [2024-11-17 02:56:52,391 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1278 transitions. Word has length 21 [2024-11-17 02:56:52,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:52,391 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1278 transitions. [2024-11-17 02:56:52,391 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-17 02:56:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1278 transitions. [2024-11-17 02:56:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 02:56:52,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:52,393 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-17 02:56:52,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-17 02:56:52,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:52,593 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr485REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:52,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:52,594 INFO L85 PathProgramCache]: Analyzing trace with hash -758642810, now seen corresponding path program 1 times [2024-11-17 02:56:52,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:52,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698342856] [2024-11-17 02:56:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:52,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:52,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:52,595 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:52,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-17 02:56:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:52,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:56:52,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:52,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:52,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:52,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698342856] [2024-11-17 02:56:52,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698342856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:52,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:52,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:56:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135506143] [2024-11-17 02:56:52,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:52,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:52,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:52,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:56:52,770 INFO L87 Difference]: Start difference. First operand 1132 states and 1278 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-17 02:56:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:52,831 INFO L93 Difference]: Finished difference Result 1102 states and 1220 transitions. [2024-11-17 02:56:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:56:52,831 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-17 02:56:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:52,834 INFO L225 Difference]: With dead ends: 1102 [2024-11-17 02:56:52,835 INFO L226 Difference]: Without dead ends: 1102 [2024-11-17 02:56:52,835 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-17 02:56:52,836 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.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:52,836 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.0s Time] [2024-11-17 02:56:52,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-11-17 02:56:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2024-11-17 02:56:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 737 states have (on average 1.6472184531886025) internal successors, (1214), 1097 states have internal predecessors, (1214), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1220 transitions. [2024-11-17 02:56:52,854 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1220 transitions. Word has length 23 [2024-11-17 02:56:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:52,854 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1220 transitions. [2024-11-17 02:56:52,854 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-17 02:56:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1220 transitions. [2024-11-17 02:56:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 02:56:52,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:52,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:52,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-17 02:56:53,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:53,058 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-17 02:56:53,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:53,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1675753888, now seen corresponding path program 1 times [2024-11-17 02:56:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630914667] [2024-11-17 02:56:53,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:53,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:53,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:53,062 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:53,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-17 02:56:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:53,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:56:53,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:53,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:56:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:53,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:53,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:53,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630914667] [2024-11-17 02:56:53,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630914667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:53,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:53,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:53,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836183068] [2024-11-17 02:56:53,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:53,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:53,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:53,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:53,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:56:53,275 INFO L87 Difference]: Start difference. First operand 1102 states and 1220 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-17 02:56:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:54,664 INFO L93 Difference]: Finished difference Result 1295 states and 1414 transitions. [2024-11-17 02:56:54,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:56:54,664 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-17 02:56:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:54,667 INFO L225 Difference]: With dead ends: 1295 [2024-11-17 02:56:54,667 INFO L226 Difference]: Without dead ends: 1295 [2024-11-17 02:56:54,667 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-17 02:56:54,668 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 795 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:54,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1167 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:56:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-11-17 02:56:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1098. [2024-11-17 02:56:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 737 states have (on average 1.6309362279511532) internal successors, (1202), 1093 states have internal predecessors, (1202), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1208 transitions. [2024-11-17 02:56:54,679 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1208 transitions. Word has length 33 [2024-11-17 02:56:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:54,680 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1208 transitions. [2024-11-17 02:56:54,680 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-17 02:56:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1208 transitions. [2024-11-17 02:56:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 02:56:54,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:54,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:54,685 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-17 02:56:54,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:54,881 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:54,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1675753889, now seen corresponding path program 1 times [2024-11-17 02:56:54,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:54,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537427972] [2024-11-17 02:56:54,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:54,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:54,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:54,884 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:54,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-17 02:56:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:55,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:56:55,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:55,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:56:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:55,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:55,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537427972] [2024-11-17 02:56:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537427972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:55,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:55,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023944421] [2024-11-17 02:56:55,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:55,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:55,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:55,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:55,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:56:55,182 INFO L87 Difference]: Start difference. First operand 1098 states and 1208 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-17 02:56:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:56,618 INFO L93 Difference]: Finished difference Result 1105 states and 1210 transitions. [2024-11-17 02:56:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:56:56,619 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-17 02:56:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:56,622 INFO L225 Difference]: With dead ends: 1105 [2024-11-17 02:56:56,622 INFO L226 Difference]: Without dead ends: 1105 [2024-11-17 02:56:56,622 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-17 02:56:56,622 INFO L432 NwaCegarLoop]: 877 mSDtfsCounter, 80 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:56,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1824 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:56:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-11-17 02:56:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1098. [2024-11-17 02:56:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 737 states have (on average 1.6255088195386702) internal successors, (1198), 1093 states have internal predecessors, (1198), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1204 transitions. [2024-11-17 02:56:56,633 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1204 transitions. Word has length 33 [2024-11-17 02:56:56,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:56,633 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1204 transitions. [2024-11-17 02:56:56,633 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-17 02:56:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1204 transitions. [2024-11-17 02:56:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 02:56:56,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:56,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:56,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-17 02:56:56,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:56,835 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-17 02:56:56,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1103966556, now seen corresponding path program 1 times [2024-11-17 02:56:56,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:56,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296808461] [2024-11-17 02:56:56,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:56,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:56,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:56,837 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:56,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-17 02:56:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:56,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:56:56,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:56,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:56:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:57,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:57,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:57,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296808461] [2024-11-17 02:56:57,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296808461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:57,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:57,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:57,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169556928] [2024-11-17 02:56:57,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:57,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:57,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:57,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:57,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:56:57,071 INFO L87 Difference]: Start difference. First operand 1098 states and 1204 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-17 02:56:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:56:58,283 INFO L93 Difference]: Finished difference Result 1105 states and 1206 transitions. [2024-11-17 02:56:58,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:56:58,284 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-17 02:56:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:56:58,286 INFO L225 Difference]: With dead ends: 1105 [2024-11-17 02:56:58,286 INFO L226 Difference]: Without dead ends: 1105 [2024-11-17 02:56:58,287 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-17 02:56:58,287 INFO L432 NwaCegarLoop]: 639 mSDtfsCounter, 617 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:56:58,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1287 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 02:56:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-11-17 02:56:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1094. [2024-11-17 02:56:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 737 states have (on average 1.6146540027137042) internal successors, (1190), 1089 states have internal predecessors, (1190), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:56:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1196 transitions. [2024-11-17 02:56:58,296 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1196 transitions. Word has length 37 [2024-11-17 02:56:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:56:58,296 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1196 transitions. [2024-11-17 02:56:58,297 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-17 02:56:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1196 transitions. [2024-11-17 02:56:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 02:56:58,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:56:58,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:56:58,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-17 02:56:58,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:58,498 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr472REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:56:58,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:56:58,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1103966557, now seen corresponding path program 1 times [2024-11-17 02:56:58,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:56:58,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241405401] [2024-11-17 02:56:58,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:56:58,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:56:58,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:56:58,500 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:56:58,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-17 02:56:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:56:58,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:56:58,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:56:58,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:56:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:56:58,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:56:58,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:56:58,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241405401] [2024-11-17 02:56:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241405401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:56:58,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:56:58,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:56:58,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903358043] [2024-11-17 02:56:58,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:56:58,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:56:58,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:56:58,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:56:58,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:56:58,807 INFO L87 Difference]: Start difference. First operand 1094 states and 1196 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-17 02:57:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:00,368 INFO L93 Difference]: Finished difference Result 1361 states and 1448 transitions. [2024-11-17 02:57:00,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:57:00,369 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-17 02:57:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:00,372 INFO L225 Difference]: With dead ends: 1361 [2024-11-17 02:57:00,372 INFO L226 Difference]: Without dead ends: 1361 [2024-11-17 02:57:00,373 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-17 02:57:00,373 INFO L432 NwaCegarLoop]: 997 mSDtfsCounter, 360 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:00,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1989 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:57:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-17 02:57:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1090. [2024-11-17 02:57:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 737 states have (on average 1.6037991858887382) internal successors, (1182), 1085 states have internal predecessors, (1182), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:57:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1188 transitions. [2024-11-17 02:57:00,383 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1188 transitions. Word has length 37 [2024-11-17 02:57:00,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:00,383 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1188 transitions. [2024-11-17 02:57:00,383 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-17 02:57:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1188 transitions. [2024-11-17 02:57:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-17 02:57:00,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:00,384 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] [2024-11-17 02:57:00,389 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 (18)] Forceful destruction successful, exit code 0 [2024-11-17 02:57:00,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:00,586 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:57:00,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1429023718, now seen corresponding path program 1 times [2024-11-17 02:57:00,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:57:00,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036946364] [2024-11-17 02:57:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:00,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:00,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:57:00,594 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:57:00,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-17 02:57:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:00,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:57:00,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:00,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:57:00,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:57:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036946364] [2024-11-17 02:57:00,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036946364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:57:00,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:57:00,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:57:00,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857578788] [2024-11-17 02:57:00,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:57:00,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:57:00,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:57:00,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:57:00,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:57:00,825 INFO L87 Difference]: Start difference. First operand 1090 states and 1188 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-17 02:57:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:00,880 INFO L93 Difference]: Finished difference Result 1072 states and 1158 transitions. [2024-11-17 02:57:00,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:57:00,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2024-11-17 02:57:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:00,883 INFO L225 Difference]: With dead ends: 1072 [2024-11-17 02:57:00,884 INFO L226 Difference]: Without dead ends: 1072 [2024-11-17 02:57:00,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-17 02:57:00,884 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-17 02:57:00,884 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-17 02:57:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-17 02:57:00,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2024-11-17 02:57:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 719 states have (on average 1.6022253129346313) internal successors, (1152), 1067 states have internal predecessors, (1152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:57:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1158 transitions. [2024-11-17 02:57:00,897 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1158 transitions. Word has length 53 [2024-11-17 02:57:00,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:00,897 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1158 transitions. [2024-11-17 02:57:00,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-17 02:57:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1158 transitions. [2024-11-17 02:57:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-17 02:57:00,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:00,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:57:00,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-17 02:57:01,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:01,100 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr428REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:57:01,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:01,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1386542889, now seen corresponding path program 1 times [2024-11-17 02:57:01,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:57:01,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301789142] [2024-11-17 02:57:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:01,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:01,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:57:01,104 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:57:01,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-17 02:57:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:01,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:57:01,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:01,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:57:01,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:57:01,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301789142] [2024-11-17 02:57:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301789142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:57:01,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:57:01,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:57:01,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741390167] [2024-11-17 02:57:01,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:57:01,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:57:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:57:01,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:57:01,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:57:01,335 INFO L87 Difference]: Start difference. First operand 1072 states and 1158 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-17 02:57:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:01,375 INFO L93 Difference]: Finished difference Result 1060 states and 1138 transitions. [2024-11-17 02:57:01,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:57:01,375 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-17 02:57:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:01,377 INFO L225 Difference]: With dead ends: 1060 [2024-11-17 02:57:01,378 INFO L226 Difference]: Without dead ends: 1060 [2024-11-17 02:57:01,378 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-17 02:57:01,378 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-17 02:57:01,378 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-17 02:57:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-17 02:57:01,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2024-11-17 02:57:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 707 states have (on average 1.6011315417256011) internal successors, (1132), 1055 states have internal predecessors, (1132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:57:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1138 transitions. [2024-11-17 02:57:01,387 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1138 transitions. Word has length 57 [2024-11-17 02:57:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:01,387 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1138 transitions. [2024-11-17 02:57:01,387 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-17 02:57:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1138 transitions. [2024-11-17 02:57:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-17 02:57:01,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:01,388 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] [2024-11-17 02:57:01,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-17 02:57:01,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:01,588 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:57:01,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash -365650590, now seen corresponding path program 1 times [2024-11-17 02:57:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:57:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986184090] [2024-11-17 02:57:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:01,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:01,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:57:01,590 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:57:01,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-17 02:57:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:01,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:57:01,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:01,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:57:01,815 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:57:01,815 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:57:01,819 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-17 02:57:01,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 02:57:01,873 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-17 02:57:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:01,912 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:57:01,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:57:01,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986184090] [2024-11-17 02:57:01,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986184090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:57:01,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:57:01,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:57:01,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323574077] [2024-11-17 02:57:01,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:57:01,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:57:01,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:57:01,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:57:01,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:57:01,913 INFO L87 Difference]: Start difference. First operand 1060 states and 1138 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-17 02:57:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:02,253 INFO L93 Difference]: Finished difference Result 1544 states and 1643 transitions. [2024-11-17 02:57:02,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:57:02,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 61 [2024-11-17 02:57:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:02,258 INFO L225 Difference]: With dead ends: 1544 [2024-11-17 02:57:02,258 INFO L226 Difference]: Without dead ends: 1540 [2024-11-17 02:57:02,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 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-17 02:57:02,259 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 1229 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:02,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 3155 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 02:57:02,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2024-11-17 02:57:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1004. [2024-11-17 02:57:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 651 states have (on average 1.6497695852534562) internal successors, (1074), 999 states have internal predecessors, (1074), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:57:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1080 transitions. [2024-11-17 02:57:02,276 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1080 transitions. Word has length 61 [2024-11-17 02:57:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:02,276 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1080 transitions. [2024-11-17 02:57:02,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-17 02:57:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1080 transitions. [2024-11-17 02:57:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-17 02:57:02,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:02,277 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-17 02:57:02,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-17 02:57:02,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:02,478 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr428REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:57:02,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash -989927393, now seen corresponding path program 1 times [2024-11-17 02:57:02,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:57:02,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739696042] [2024-11-17 02:57:02,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:02,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:02,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:57:02,480 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:57:02,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-17 02:57:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:02,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 02:57:02,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:02,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:57:02,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:57:03,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:57:03,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 02:57:03,216 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:57:03,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-17 02:57:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:03,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:57:03,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:57:03,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739696042] [2024-11-17 02:57:03,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739696042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:57:03,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:57:03,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:57:03,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804046195] [2024-11-17 02:57:03,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:57:03,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:57:03,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:57:03,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:57:03,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:57:03,227 INFO L87 Difference]: Start difference. First operand 1004 states and 1080 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-17 02:57:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:04,218 INFO L93 Difference]: Finished difference Result 966 states and 1042 transitions. [2024-11-17 02:57:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:57:04,219 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-17 02:57:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:04,222 INFO L225 Difference]: With dead ends: 966 [2024-11-17 02:57:04,222 INFO L226 Difference]: Without dead ends: 966 [2024-11-17 02:57:04,222 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-17 02:57:04,223 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 1074 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:04,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 579 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 02:57:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-11-17 02:57:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 927. [2024-11-17 02:57:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 612 states have (on average 1.5686274509803921) internal successors, (960), 922 states have internal predecessors, (960), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:57:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 966 transitions. [2024-11-17 02:57:04,231 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 966 transitions. Word has length 65 [2024-11-17 02:57:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:04,231 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 966 transitions. [2024-11-17 02:57:04,231 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-17 02:57:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 966 transitions. [2024-11-17 02:57:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-17 02:57:04,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:04,232 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-17 02:57:04,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 (22)] Ended with exit code 0 [2024-11-17 02:57:04,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:04,433 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:57:04,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:04,433 INFO L85 PathProgramCache]: Analyzing trace with hash -150817521, now seen corresponding path program 1 times [2024-11-17 02:57:04,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:57:04,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756949904] [2024-11-17 02:57:04,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:04,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:04,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:57:04,435 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:57:04,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-17 02:57:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:04,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:57:04,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:04,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:57:04,683 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-17 02:57:04,696 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-17 02:57:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:04,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:57:04,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:57:04,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756949904] [2024-11-17 02:57:04,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756949904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:57:04,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:57:04,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:57:04,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022082225] [2024-11-17 02:57:04,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:57:04,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:57:04,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:57:04,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:57:04,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:57:04,705 INFO L87 Difference]: Start difference. First operand 927 states and 966 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-17 02:57:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:06,025 INFO L93 Difference]: Finished difference Result 926 states and 965 transitions. [2024-11-17 02:57:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:57:06,028 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-17 02:57:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:06,031 INFO L225 Difference]: With dead ends: 926 [2024-11-17 02:57:06,031 INFO L226 Difference]: Without dead ends: 926 [2024-11-17 02:57:06,031 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-17 02:57:06,032 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 2 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:06,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2164 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 02:57:06,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-17 02:57:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2024-11-17 02:57:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 612 states have (on average 1.5669934640522876) internal successors, (959), 921 states have internal predecessors, (959), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:57:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 965 transitions. [2024-11-17 02:57:06,042 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 965 transitions. Word has length 70 [2024-11-17 02:57:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:06,043 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 965 transitions. [2024-11-17 02:57:06,043 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-17 02:57:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 965 transitions. [2024-11-17 02:57:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-17 02:57:06,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:06,044 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-17 02:57:06,053 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 (23)] Ended with exit code 0 [2024-11-17 02:57:06,244 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-17 02:57:06,244 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:57:06,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash -150817520, now seen corresponding path program 1 times [2024-11-17 02:57:06,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:57:06,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826784270] [2024-11-17 02:57:06,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:06,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:06,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:57:06,247 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-17 02:57:06,247 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-17 02:57:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:06,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 02:57:06,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:06,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:57:06,542 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-17 02:57:06,551 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-17 02:57:06,589 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-17 02:57:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:06,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:57:06,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:57:06,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826784270] [2024-11-17 02:57:06,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826784270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:57:06,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:57:06,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:57:06,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828533274] [2024-11-17 02:57:06,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:57:06,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:57:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:57:06,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:57:06,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:57:06,607 INFO L87 Difference]: Start difference. First operand 926 states and 965 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-17 02:57:08,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:08,311 INFO L93 Difference]: Finished difference Result 925 states and 964 transitions. [2024-11-17 02:57:08,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:57:08,312 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-17 02:57:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:08,315 INFO L225 Difference]: With dead ends: 925 [2024-11-17 02:57:08,315 INFO L226 Difference]: Without dead ends: 925 [2024-11-17 02:57:08,315 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-17 02:57:08,315 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 1 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:08,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2196 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:57:08,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-17 02:57:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2024-11-17 02:57:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 611 states have (on average 1.5679214402618658) internal successors, (958), 920 states have internal predecessors, (958), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:57:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 964 transitions. [2024-11-17 02:57:08,329 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 964 transitions. Word has length 70 [2024-11-17 02:57:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:08,329 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 964 transitions. [2024-11-17 02:57:08,329 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-17 02:57:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 964 transitions. [2024-11-17 02:57:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 02:57:08,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:08,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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:57:08,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-17 02:57:08,530 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-17 02:57:08,530 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:57:08,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:08,531 INFO L85 PathProgramCache]: Analyzing trace with hash -546754771, now seen corresponding path program 1 times [2024-11-17 02:57:08,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:57:08,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066634149] [2024-11-17 02:57:08,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:08,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-17 02:57:08,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:57:08,533 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-17 02:57:08,534 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-17 02:57:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:08,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:57:08,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:57:08,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:57:08,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:57:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066634149] [2024-11-17 02:57:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066634149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:57:08,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:57:08,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:57:08,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095947476] [2024-11-17 02:57:08,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:57:08,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:57:08,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:57:08,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:57:08,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:57:08,794 INFO L87 Difference]: Start difference. First operand 925 states and 964 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-17 02:57:08,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:08,820 INFO L93 Difference]: Finished difference Result 928 states and 968 transitions. [2024-11-17 02:57:08,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:57:08,821 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-17 02:57:08,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:08,825 INFO L225 Difference]: With dead ends: 928 [2024-11-17 02:57:08,825 INFO L226 Difference]: Without dead ends: 928 [2024-11-17 02:57:08,825 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-17 02:57:08,826 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-17 02:57:08,826 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-17 02:57:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-11-17 02:57:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2024-11-17 02:57:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 613 states have (on average 1.567699836867863) internal successors, (961), 923 states have internal predecessors, (961), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:57:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 968 transitions. [2024-11-17 02:57:08,842 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 968 transitions. Word has length 78 [2024-11-17 02:57:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:08,842 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 968 transitions. [2024-11-17 02:57:08,843 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-17 02:57:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 968 transitions. [2024-11-17 02:57:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-17 02:57:08,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:08,843 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-17 02:57:08,852 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 (25)] Ended with exit code 0 [2024-11-17 02:57:09,044 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-17 02:57:09,044 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:57:09,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:09,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1867228317, now seen corresponding path program 1 times [2024-11-17 02:57:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:57:09,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856979624] [2024-11-17 02:57:09,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:57:09,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:09,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:57:09,046 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-17 02:57:09,047 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-17 02:57:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:57:09,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:57:09,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:09,314 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-17 02:57:09,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:57:09,366 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-17 02:57:09,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:57:09,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856979624] [2024-11-17 02:57:09,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856979624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:57:09,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:57:09,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 02:57:09,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068227966] [2024-11-17 02:57:09,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:57:09,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 02:57:09,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:57:09,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 02:57:09,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 02:57:09,369 INFO L87 Difference]: Start difference. First operand 928 states and 968 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-17 02:57:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:09,468 INFO L93 Difference]: Finished difference Result 940 states and 985 transitions. [2024-11-17 02:57:09,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:57:09,469 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-17 02:57:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:09,471 INFO L225 Difference]: With dead ends: 940 [2024-11-17 02:57:09,471 INFO L226 Difference]: Without dead ends: 940 [2024-11-17 02:57:09,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-17 02:57:09,472 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 8 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:09,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2488 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:57:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-11-17 02:57:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 938. [2024-11-17 02:57:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 622 states have (on average 1.5691318327974277) internal successors, (976), 932 states have internal predecessors, (976), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:57:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 983 transitions. [2024-11-17 02:57:09,484 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 983 transitions. Word has length 79 [2024-11-17 02:57:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:09,484 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 983 transitions. [2024-11-17 02:57:09,484 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-17 02:57:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 983 transitions. [2024-11-17 02:57:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-17 02:57:09,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:09,485 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-17 02:57:09,494 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-17 02:57:09,686 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-17 02:57:09,686 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:57:09,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:09,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1861061805, now seen corresponding path program 2 times [2024-11-17 02:57:09,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:57:09,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917055239] [2024-11-17 02:57:09,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 02:57:09,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:09,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:57:09,694 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-17 02:57:09,696 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-17 02:57:10,100 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 02:57:10,100 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:57:10,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 02:57:10,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:10,160 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-17 02:57:10,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:57:10,259 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-17 02:57:10,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:57:10,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917055239] [2024-11-17 02:57:10,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917055239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:57:10,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:57:10,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 02:57:10,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011393480] [2024-11-17 02:57:10,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:57:10,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:57:10,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:57:10,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:57:10,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:57:10,262 INFO L87 Difference]: Start difference. First operand 938 states and 983 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-17 02:57:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:10,615 INFO L93 Difference]: Finished difference Result 953 states and 1005 transitions. [2024-11-17 02:57:10,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 02:57:10,616 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-17 02:57:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:10,622 INFO L225 Difference]: With dead ends: 953 [2024-11-17 02:57:10,622 INFO L226 Difference]: Without dead ends: 949 [2024-11-17 02:57:10,622 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-17 02:57:10,623 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 12 mSDsluCounter, 4138 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4968 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:10,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4968 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:57:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-17 02:57:10,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 947. [2024-11-17 02:57:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 631 states have (on average 1.565768621236133) internal successors, (988), 941 states have internal predecessors, (988), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:57:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 995 transitions. [2024-11-17 02:57:10,640 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 995 transitions. Word has length 82 [2024-11-17 02:57:10,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:10,640 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 995 transitions. [2024-11-17 02:57:10,640 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-17 02:57:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 995 transitions. [2024-11-17 02:57:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 02:57:10,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:10,641 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-17 02:57:10,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-17 02:57:10,841 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-17 02:57:10,842 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:57:10,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:10,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1143344915, now seen corresponding path program 3 times [2024-11-17 02:57:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:57:10,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700754431] [2024-11-17 02:57:10,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 02:57:10,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:10,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:57:10,844 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-17 02:57:10,845 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-17 02:57:11,436 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-17 02:57:11,436 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:57:11,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 02:57:11,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:11,588 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-17 02:57:11,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:57:12,101 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-17 02:57:12,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:57:12,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700754431] [2024-11-17 02:57:12,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700754431] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:57:12,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:57:12,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 02:57:12,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971823632] [2024-11-17 02:57:12,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:57:12,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 02:57:12,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:57:12,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 02:57:12,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 02:57:12,103 INFO L87 Difference]: Start difference. First operand 947 states and 995 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-17 02:57:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:13,512 INFO L93 Difference]: Finished difference Result 971 states and 1034 transitions. [2024-11-17 02:57:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 02:57:13,513 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-17 02:57:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:13,515 INFO L225 Difference]: With dead ends: 971 [2024-11-17 02:57:13,515 INFO L226 Difference]: Without dead ends: 965 [2024-11-17 02:57:13,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 02:57:13,516 INFO L432 NwaCegarLoop]: 831 mSDtfsCounter, 26 mSDsluCounter, 9110 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9941 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:13,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9941 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:57:13,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-11-17 02:57:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2024-11-17 02:57:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 649 states have (on average 1.5577812018489985) internal successors, (1011), 959 states have internal predecessors, (1011), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:57:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1018 transitions. [2024-11-17 02:57:13,528 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1018 transitions. Word has length 88 [2024-11-17 02:57:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:13,529 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1018 transitions. [2024-11-17 02:57:13,529 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-17 02:57:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1018 transitions. [2024-11-17 02:57:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-17 02:57:13,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:13,530 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-17 02:57:13,542 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 (28)] Forceful destruction successful, exit code 0 [2024-11-17 02:57:13,730 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-17 02:57:13,731 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:57:13,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:13,731 INFO L85 PathProgramCache]: Analyzing trace with hash -357422739, now seen corresponding path program 4 times [2024-11-17 02:57:13,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:57:13,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39738359] [2024-11-17 02:57:13,732 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 02:57:13,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:13,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:57:13,733 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-17 02:57:13,734 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-17 02:57:14,229 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 02:57:14,230 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:57:14,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 02:57:14,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:14,559 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-17 02:57:14,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:57:15,720 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-17 02:57:15,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:57:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39738359] [2024-11-17 02:57:15,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39738359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:57:15,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:57:15,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 02:57:15,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364725751] [2024-11-17 02:57:15,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:57:15,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 02:57:15,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:57:15,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 02:57:15,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 02:57:15,724 INFO L87 Difference]: Start difference. First operand 965 states and 1018 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-17 02:57:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:57:20,202 INFO L93 Difference]: Finished difference Result 1005 states and 1090 transitions. [2024-11-17 02:57:20,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 02:57:20,203 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-17 02:57:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:57:20,204 INFO L225 Difference]: With dead ends: 1005 [2024-11-17 02:57:20,204 INFO L226 Difference]: Without dead ends: 1001 [2024-11-17 02:57:20,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 02:57:20,208 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 27 mSDsluCounter, 19024 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 19854 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:57:20,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 19854 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:57:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-17 02:57:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 999. [2024-11-17 02:57:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 683 states have (on average 1.547584187408492) internal successors, (1057), 993 states have internal predecessors, (1057), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 02:57:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1064 transitions. [2024-11-17 02:57:20,219 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1064 transitions. Word has length 100 [2024-11-17 02:57:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:57:20,219 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1064 transitions. [2024-11-17 02:57:20,219 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-17 02:57:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1064 transitions. [2024-11-17 02:57:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-17 02:57:20,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:57:20,220 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-17 02:57:20,236 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-17 02:57:20,421 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-17 02:57:20,421 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-17 02:57:20,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:57:20,422 INFO L85 PathProgramCache]: Analyzing trace with hash -871763027, now seen corresponding path program 5 times [2024-11-17 02:57:20,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:57:20,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275129426] [2024-11-17 02:57:20,423 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 02:57:20,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:57:20,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:57:20,424 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-17 02:57:20,425 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-17 02:57:21,457 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-17 02:57:21,457 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:57:21,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-17 02:57:21,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:57:21,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:57:21,612 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:57:21,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-17 02:57:21,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:57:21,646 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-17 02:57:21,653 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-17 02:57:21,768 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 22 treesize of output 10 [2024-11-17 02:57:21,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:57:22,419 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:57:22,419 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 62 treesize of output 57 [2024-11-17 02:57:22,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:57:22,454 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 31 treesize of output 13 [2024-11-17 02:57:22,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 02:57:22,477 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-17 02:57:22,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:57:23,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-17 02:57:23,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:57:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275129426] [2024-11-17 02:57:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275129426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:57:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [49489053] [2024-11-17 02:57:23,424 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 02:57:23,424 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 02:57:23,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 02:57:23,426 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-17 02:57:23,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process