./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-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 60f6803c5e3744d9299e1af81cd011414f5ac623b556345642fa85a1d93686e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:30:46,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:30:47,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:30:47,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:30:47,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:30:47,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:30:47,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:30:47,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:30:47,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:30:47,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:30:47,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:30:47,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:30:47,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:30:47,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:30:47,096 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:30:47,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:30:47,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:30:47,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:30:47,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:30:47,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:30:47,101 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:30:47,102 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:30:47,102 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:30:47,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:30:47,103 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:30:47,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:30:47,103 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:30:47,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:30:47,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:30:47,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:30:47,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:30:47,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:30:47,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:30:47,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:30:47,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:30:47,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:30:47,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:30:47,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:30:47,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:30:47,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:30:47,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:30:47,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:30:47,108 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 -> 60f6803c5e3744d9299e1af81cd011414f5ac623b556345642fa85a1d93686e4 [2024-11-10 17:30:47,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:30:47,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:30:47,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:30:47,415 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:30:47,415 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:30:47,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i [2024-11-10 17:30:48,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:30:49,139 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:30:49,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i [2024-11-10 17:30:49,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620c7aeee/84727ca720bb4208aa79ef63279aa9e2/FLAGdfeefe607 [2024-11-10 17:30:49,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620c7aeee/84727ca720bb4208aa79ef63279aa9e2 [2024-11-10 17:30:49,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:30:49,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:30:49,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:30:49,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:30:49,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:30:49,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:30:49" (1/1) ... [2024-11-10 17:30:49,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258dd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:49, skipping insertion in model container [2024-11-10 17:30:49,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:30:49" (1/1) ... [2024-11-10 17:30:49,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:30:49,663 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:49,701 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:49,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-10 17:30:49,713 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:49,735 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:49,750 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:49,752 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:49,755 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:49,756 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:49,757 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:49,758 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:49,764 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:49,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:30:49,794 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-10 17:30:49,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@437fbd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:49, skipping insertion in model container [2024-11-10 17:30:49,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:30:49,798 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 17:30:49,800 INFO L158 Benchmark]: Toolchain (without parser) took 614.27ms. Allocated memory is still 151.0MB. Free memory was 95.2MB in the beginning and 74.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 17:30:49,801 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:30:49,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.80ms. Allocated memory is still 151.0MB. Free memory was 94.8MB in the beginning and 74.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 17:30:49,803 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.80ms. Allocated memory is still 151.0MB. Free memory was 94.8MB in the beginning and 74.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 764]: 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_JEN_test1-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 60f6803c5e3744d9299e1af81cd011414f5ac623b556345642fa85a1d93686e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:30:51,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:30:51,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:30:51,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:30:51,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:30:51,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:30:51,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:30:51,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:30:51,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:30:51,961 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:30:51,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:30:51,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:30:51,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:30:51,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:30:51,963 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:30:51,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:30:51,963 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:30:51,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:30:51,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:30:51,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:30:51,965 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:30:51,967 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:30:51,968 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:30:51,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:30:51,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:30:51,969 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:30:51,969 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:30:51,969 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:30:51,969 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:30:51,969 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:30:51,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:30:51,970 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:30:51,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:30:51,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:30:51,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:30:51,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:30:51,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:30:51,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:30:51,971 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:30:51,972 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:30:51,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:30:51,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:30:51,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:30:51,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:30:51,974 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 -> 60f6803c5e3744d9299e1af81cd011414f5ac623b556345642fa85a1d93686e4 [2024-11-10 17:30:52,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:30:52,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:30:52,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:30:52,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:30:52,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:30:52,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i [2024-11-10 17:30:53,926 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:30:54,186 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:30:54,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i [2024-11-10 17:30:54,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25155dec/6a4eca15879c43ab928f1029fe4450f9/FLAG1442a604f [2024-11-10 17:30:54,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25155dec/6a4eca15879c43ab928f1029fe4450f9 [2024-11-10 17:30:54,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:30:54,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:30:54,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:30:54,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:30:54,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:30:54,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:30:54" (1/1) ... [2024-11-10 17:30:54,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f431fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:54, skipping insertion in model container [2024-11-10 17:30:54,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:30:54" (1/1) ... [2024-11-10 17:30:54,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:30:54,731 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,768 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,772 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,778 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,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-10 17:30:54,807 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,811 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,814 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,818 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,819 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,820 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,824 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:30:54,841 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 17:30:54,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:30:54,890 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,909 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,915 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,918 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,927 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,946 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,946 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,955 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,956 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,957 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,957 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,962 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:30:54,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:30:54,978 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:30:55,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:30:55,100 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:30:55,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55 WrapperNode [2024-11-10 17:30:55,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:30:55,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:30:55,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:30:55,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:30:55,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55" (1/1) ... [2024-11-10 17:30:55,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55" (1/1) ... [2024-11-10 17:30:55,195 INFO L138 Inliner]: procedures = 179, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 784 [2024-11-10 17:30:55,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:30:55,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:30:55,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:30:55,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:30:55,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55" (1/1) ... [2024-11-10 17:30:55,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55" (1/1) ... [2024-11-10 17:30:55,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55" (1/1) ... [2024-11-10 17:30:55,306 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-11-10 17:30:55,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55" (1/1) ... [2024-11-10 17:30:55,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55" (1/1) ... [2024-11-10 17:30:55,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55" (1/1) ... [2024-11-10 17:30:55,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55" (1/1) ... [2024-11-10 17:30:55,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55" (1/1) ... [2024-11-10 17:30:55,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55" (1/1) ... [2024-11-10 17:30:55,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:30:55,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:30:55,375 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:30:55,375 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:30:55,376 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55" (1/1) ... [2024-11-10 17:30:55,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:30:55,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:30:55,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:30:55,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:30:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 17:30:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 17:30:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 17:30:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 17:30:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 17:30:55,486 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 17:30:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:30:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:30:55,487 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:30:55,487 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:30:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:30:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:30:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:30:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:30:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:30:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:30:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:30:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 17:30:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 17:30:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:30:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 17:30:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:30:55,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:30:55,687 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:30:55,689 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:30:58,306 INFO L? ?]: Removed 906 outVars from TransFormulas that were not future-live. [2024-11-10 17:30:58,307 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:30:58,342 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:30:58,343 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:30:58,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:30:58 BoogieIcfgContainer [2024-11-10 17:30:58,343 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:30:58,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:30:58,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:30:58,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:30:58,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:30:54" (1/3) ... [2024-11-10 17:30:58,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2741ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:30:58, skipping insertion in model container [2024-11-10 17:30:58,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:55" (2/3) ... [2024-11-10 17:30:58,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2741ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:30:58, skipping insertion in model container [2024-11-10 17:30:58,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:30:58" (3/3) ... [2024-11-10 17:30:58,352 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test1-2.i [2024-11-10 17:30:58,375 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:30:58,376 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 425 error locations. [2024-11-10 17:30:58,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:30:58,444 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;@d743588, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:30:58,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2024-11-10 17:30:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 878 states, 440 states have (on average 2.1704545454545454) internal successors, (955), 872 states have internal predecessors, (955), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:30:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:30:58,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:30:58,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:30:58,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:30:58,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:30:58,463 INFO L85 PathProgramCache]: Analyzing trace with hash 198087389, now seen corresponding path program 1 times [2024-11-10 17:30:58,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:30:58,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857294831] [2024-11-10 17:30:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:30:58,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:30:58,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:30:58,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:30:58,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 17:30:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:30:58,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 17:30:58,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:30:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:30:58,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:30:58,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:30:58,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857294831] [2024-11-10 17:30:58,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857294831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:30:58,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:30:58,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:30:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351362840] [2024-11-10 17:30:58,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:30:58,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 17:30:58,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:30:58,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 17:30:58,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:30:58,667 INFO L87 Difference]: Start difference. First operand has 878 states, 440 states have (on average 2.1704545454545454) internal successors, (955), 872 states have internal predecessors, (955), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:30:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:30:58,730 INFO L93 Difference]: Finished difference Result 867 states and 924 transitions. [2024-11-10 17:30:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 17:30:58,733 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-11-10 17:30:58,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:30:58,751 INFO L225 Difference]: With dead ends: 867 [2024-11-10 17:30:58,751 INFO L226 Difference]: Without dead ends: 864 [2024-11-10 17:30:58,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:30:58,755 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:30:58,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:30:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-10 17:30:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2024-11-10 17:30:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 432 states have (on average 2.071759259259259) internal successors, (895), 858 states have internal predecessors, (895), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:30:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 921 transitions. [2024-11-10 17:30:58,831 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 921 transitions. Word has length 6 [2024-11-10 17:30:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:30:58,831 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 921 transitions. [2024-11-10 17:30:58,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:30:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 921 transitions. [2024-11-10 17:30:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:30:58,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:30:58,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:30:58,835 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-10 17:30:59,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:30:59,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:30:59,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:30:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash 198087420, now seen corresponding path program 1 times [2024-11-10 17:30:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:30:59,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314441198] [2024-11-10 17:30:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:30:59,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:30:59,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:30:59,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:30:59,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 17:30:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:30:59,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:30:59,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:30:59,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:30:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:30:59,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:30:59,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:30:59,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314441198] [2024-11-10 17:30:59,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314441198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:30:59,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:30:59,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:30:59,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033632503] [2024-11-10 17:30:59,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:30:59,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:30:59,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:30:59,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:30:59,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:30:59,212 INFO L87 Difference]: Start difference. First operand 864 states and 921 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:00,450 INFO L93 Difference]: Finished difference Result 818 states and 876 transitions. [2024-11-10 17:31:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:31:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-10 17:31:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:00,455 INFO L225 Difference]: With dead ends: 818 [2024-11-10 17:31:00,455 INFO L226 Difference]: Without dead ends: 818 [2024-11-10 17:31:00,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:00,456 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 545 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:00,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 685 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:31:00,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-11-10 17:31:00,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 815. [2024-11-10 17:31:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 432 states have (on average 1.9583333333333333) internal successors, (846), 809 states have internal predecessors, (846), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:31:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 872 transitions. [2024-11-10 17:31:00,475 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 872 transitions. Word has length 6 [2024-11-10 17:31:00,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:00,476 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 872 transitions. [2024-11-10 17:31:00,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 872 transitions. [2024-11-10 17:31:00,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:31:00,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:00,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:31:00,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 17:31:00,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:00,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr423REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:00,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:00,679 INFO L85 PathProgramCache]: Analyzing trace with hash 198087421, now seen corresponding path program 1 times [2024-11-10 17:31:00,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:00,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483684406] [2024-11-10 17:31:00,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:00,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:00,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:00,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:00,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 17:31:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:00,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:31:00,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:00,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:31:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:00,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:31:00,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:00,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483684406] [2024-11-10 17:31:00,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483684406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:00,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:00,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:31:00,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299805281] [2024-11-10 17:31:00,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:00,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:31:00,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:00,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:31:00,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:00,805 INFO L87 Difference]: Start difference. First operand 815 states and 872 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:01,927 INFO L93 Difference]: Finished difference Result 893 states and 954 transitions. [2024-11-10 17:31:01,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:31:01,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-10 17:31:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:01,933 INFO L225 Difference]: With dead ends: 893 [2024-11-10 17:31:01,933 INFO L226 Difference]: Without dead ends: 893 [2024-11-10 17:31:01,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:01,934 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 269 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:01,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1084 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:31:01,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-11-10 17:31:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 844. [2024-11-10 17:31:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 471 states have (on average 1.9363057324840764) internal successors, (912), 838 states have internal predecessors, (912), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:31:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 938 transitions. [2024-11-10 17:31:01,956 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 938 transitions. Word has length 6 [2024-11-10 17:31:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:01,957 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 938 transitions. [2024-11-10 17:31:01,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 938 transitions. [2024-11-10 17:31:01,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 17:31:01,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:01,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:31:01,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 17:31:02,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:02,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:02,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:02,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1361102008, now seen corresponding path program 1 times [2024-11-10 17:31:02,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:02,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278005136] [2024-11-10 17:31:02,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:02,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:02,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:02,164 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:02,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 17:31:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:02,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:31:02,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:02,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:31:02,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:02,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278005136] [2024-11-10 17:31:02,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278005136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:02,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:02,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:31:02,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197156337] [2024-11-10 17:31:02,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:02,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:31:02,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:02,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:31:02,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:02,259 INFO L87 Difference]: Start difference. First operand 844 states and 938 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:02,343 INFO L93 Difference]: Finished difference Result 1429 states and 1586 transitions. [2024-11-10 17:31:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:31:02,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-10 17:31:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:02,353 INFO L225 Difference]: With dead ends: 1429 [2024-11-10 17:31:02,354 INFO L226 Difference]: Without dead ends: 1429 [2024-11-10 17:31:02,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:02,355 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 564 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:02,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1714 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:31:02,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2024-11-10 17:31:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 846. [2024-11-10 17:31:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 473 states have (on average 1.9323467230443974) internal successors, (914), 840 states have internal predecessors, (914), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:31:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 940 transitions. [2024-11-10 17:31:02,378 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 940 transitions. Word has length 8 [2024-11-10 17:31:02,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:02,378 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 940 transitions. [2024-11-10 17:31:02,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 940 transitions. [2024-11-10 17:31:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 17:31:02,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:02,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:31:02,383 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-10 17:31:02,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:02,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:02,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash -968990448, now seen corresponding path program 1 times [2024-11-10 17:31:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:02,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019231793] [2024-11-10 17:31:02,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:02,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:02,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:02,587 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:02,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 17:31:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:02,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:31:02,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:02,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:31:02,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:02,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019231793] [2024-11-10 17:31:02,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019231793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:02,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:02,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:31:02,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805013182] [2024-11-10 17:31:02,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:02,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:31:02,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:31:02,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:02,730 INFO L87 Difference]: Start difference. First operand 846 states and 940 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:02,760 INFO L93 Difference]: Finished difference Result 804 states and 897 transitions. [2024-11-10 17:31:02,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:31:02,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-11-10 17:31:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:02,764 INFO L225 Difference]: With dead ends: 804 [2024-11-10 17:31:02,764 INFO L226 Difference]: Without dead ends: 804 [2024-11-10 17:31:02,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:02,765 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 71 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:02,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1550 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:31:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-11-10 17:31:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2024-11-10 17:31:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 455 states have (on average 1.9142857142857144) internal successors, (871), 798 states have internal predecessors, (871), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:31:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 897 transitions. [2024-11-10 17:31:02,779 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 897 transitions. Word has length 13 [2024-11-10 17:31:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:02,780 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 897 transitions. [2024-11-10 17:31:02,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:02,780 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 897 transitions. [2024-11-10 17:31:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 17:31:02,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:02,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:31:02,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 17:31:02,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:02,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr394REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:02,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 808041060, now seen corresponding path program 1 times [2024-11-10 17:31:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:02,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345986402] [2024-11-10 17:31:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:02,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:02,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:02,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:02,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 17:31:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:03,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:31:03,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:03,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:31:03,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:03,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345986402] [2024-11-10 17:31:03,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345986402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:03,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:03,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:31:03,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909994963] [2024-11-10 17:31:03,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:03,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:31:03,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:03,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:31:03,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:31:03,130 INFO L87 Difference]: Start difference. First operand 804 states and 897 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:03,199 INFO L93 Difference]: Finished difference Result 782 states and 868 transitions. [2024-11-10 17:31:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:31:03,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-10 17:31:03,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:03,202 INFO L225 Difference]: With dead ends: 782 [2024-11-10 17:31:03,202 INFO L226 Difference]: Without dead ends: 782 [2024-11-10 17:31:03,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:31:03,204 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 48 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:03,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2259 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:31:03,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-10 17:31:03,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2024-11-10 17:31:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 447 states have (on average 1.883668903803132) internal successors, (842), 776 states have internal predecessors, (842), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:31:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 868 transitions. [2024-11-10 17:31:03,221 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 868 transitions. Word has length 15 [2024-11-10 17:31:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:03,222 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 868 transitions. [2024-11-10 17:31:03,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 868 transitions. [2024-11-10 17:31:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 17:31:03,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:03,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:31:03,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 17:31:03,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:03,424 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr380REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:03,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:03,424 INFO L85 PathProgramCache]: Analyzing trace with hash 680894458, now seen corresponding path program 1 times [2024-11-10 17:31:03,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:03,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591826568] [2024-11-10 17:31:03,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:03,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:03,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:03,426 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:03,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 17:31:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:03,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:31:03,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:03,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:31:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:03,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:31:03,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:03,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591826568] [2024-11-10 17:31:03,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591826568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:03,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:03,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:31:03,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160890270] [2024-11-10 17:31:03,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:03,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:31:03,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:03,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:31:03,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:31:03,632 INFO L87 Difference]: Start difference. First operand 782 states and 868 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:05,109 INFO L93 Difference]: Finished difference Result 782 states and 868 transitions. [2024-11-10 17:31:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:31:05,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2024-11-10 17:31:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:05,114 INFO L225 Difference]: With dead ends: 782 [2024-11-10 17:31:05,114 INFO L226 Difference]: Without dead ends: 782 [2024-11-10 17:31:05,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:31:05,115 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 482 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:05,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 983 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:31:05,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-10 17:31:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 778. [2024-11-10 17:31:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 447 states have (on average 1.8747203579418346) internal successors, (838), 772 states have internal predecessors, (838), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:31:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 864 transitions. [2024-11-10 17:31:05,130 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 864 transitions. Word has length 29 [2024-11-10 17:31:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:05,130 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 864 transitions. [2024-11-10 17:31:05,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 864 transitions. [2024-11-10 17:31:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 17:31:05,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:05,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:31:05,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 17:31:05,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:05,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:05,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash 680894459, now seen corresponding path program 1 times [2024-11-10 17:31:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:05,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633667080] [2024-11-10 17:31:05,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:05,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:05,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:05,337 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:05,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 17:31:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:05,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:31:05,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:05,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:31:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:05,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:31:05,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:05,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633667080] [2024-11-10 17:31:05,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633667080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:05,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:05,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:31:05,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534822481] [2024-11-10 17:31:05,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:05,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:31:05,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:05,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:31:05,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:31:05,661 INFO L87 Difference]: Start difference. First operand 778 states and 864 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:07,184 INFO L93 Difference]: Finished difference Result 827 states and 880 transitions. [2024-11-10 17:31:07,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:31:07,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2024-11-10 17:31:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:07,188 INFO L225 Difference]: With dead ends: 827 [2024-11-10 17:31:07,188 INFO L226 Difference]: Without dead ends: 827 [2024-11-10 17:31:07,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:31:07,189 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 202 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:07,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1423 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 17:31:07,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-11-10 17:31:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 774. [2024-11-10 17:31:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 447 states have (on average 1.8657718120805369) internal successors, (834), 768 states have internal predecessors, (834), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:31:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 860 transitions. [2024-11-10 17:31:07,203 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 860 transitions. Word has length 29 [2024-11-10 17:31:07,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:07,203 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 860 transitions. [2024-11-10 17:31:07,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 860 transitions. [2024-11-10 17:31:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 17:31:07,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:07,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:31:07,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 17:31:07,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:07,406 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr366REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:07,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:07,406 INFO L85 PathProgramCache]: Analyzing trace with hash 389335452, now seen corresponding path program 1 times [2024-11-10 17:31:07,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:07,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497291836] [2024-11-10 17:31:07,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:07,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:07,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:07,409 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:07,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 17:31:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:07,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:31:07,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:07,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:31:07,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:07,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497291836] [2024-11-10 17:31:07,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497291836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:07,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:07,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:31:07,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299841460] [2024-11-10 17:31:07,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:07,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:31:07,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:07,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:31:07,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:31:07,633 INFO L87 Difference]: Start difference. First operand 774 states and 860 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:07,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:07,696 INFO L93 Difference]: Finished difference Result 768 states and 850 transitions. [2024-11-10 17:31:07,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:31:07,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2024-11-10 17:31:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:07,700 INFO L225 Difference]: With dead ends: 768 [2024-11-10 17:31:07,700 INFO L226 Difference]: Without dead ends: 768 [2024-11-10 17:31:07,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:31:07,701 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 21 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:07,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2236 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:31:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-10 17:31:07,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2024-11-10 17:31:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 441 states have (on average 1.8684807256235827) internal successors, (824), 762 states have internal predecessors, (824), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:31:07,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 850 transitions. [2024-11-10 17:31:07,715 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 850 transitions. Word has length 46 [2024-11-10 17:31:07,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:07,716 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 850 transitions. [2024-11-10 17:31:07,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:07,717 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 850 transitions. [2024-11-10 17:31:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 17:31:07,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:07,718 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] [2024-11-10 17:31:07,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-10 17:31:07,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:07,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr366REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:07,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1693980244, now seen corresponding path program 1 times [2024-11-10 17:31:07,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:07,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219591158] [2024-11-10 17:31:07,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:07,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:07,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:07,921 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:07,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 17:31:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:08,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:31:08,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:08,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:31:08,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:08,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219591158] [2024-11-10 17:31:08,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219591158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:08,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:08,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:31:08,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741373985] [2024-11-10 17:31:08,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:08,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:31:08,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:08,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:31:08,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:08,353 INFO L87 Difference]: Start difference. First operand 768 states and 850 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:08,543 INFO L93 Difference]: Finished difference Result 994 states and 1105 transitions. [2024-11-10 17:31:08,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:31:08,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2024-11-10 17:31:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:08,548 INFO L225 Difference]: With dead ends: 994 [2024-11-10 17:31:08,548 INFO L226 Difference]: Without dead ends: 994 [2024-11-10 17:31:08,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:31:08,549 INFO L432 NwaCegarLoop]: 845 mSDtfsCounter, 184 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1550 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:08,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1550 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:31:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-11-10 17:31:08,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 817. [2024-11-10 17:31:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 490 states have (on average 1.7816326530612245) internal successors, (873), 811 states have internal predecessors, (873), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:31:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 899 transitions. [2024-11-10 17:31:08,567 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 899 transitions. Word has length 54 [2024-11-10 17:31:08,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:08,567 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 899 transitions. [2024-11-10 17:31:08,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 899 transitions. [2024-11-10 17:31:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 17:31:08,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:08,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:31:08,575 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-10 17:31:08,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:08,770 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr337REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:08,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:08,771 INFO L85 PathProgramCache]: Analyzing trace with hash -501866947, now seen corresponding path program 1 times [2024-11-10 17:31:08,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:08,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441972173] [2024-11-10 17:31:08,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:08,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:08,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:08,775 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:08,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 17:31:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:09,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:31:09,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:09,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:31:09,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:31:09,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:31:09,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 17:31:09,585 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:31:09,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 17:31:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:09,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:31:09,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:09,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441972173] [2024-11-10 17:31:09,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441972173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:09,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:09,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:31:09,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998229448] [2024-11-10 17:31:09,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:09,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:31:09,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:09,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:31:09,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:31:09,602 INFO L87 Difference]: Start difference. First operand 817 states and 899 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:10,635 INFO L93 Difference]: Finished difference Result 779 states and 861 transitions. [2024-11-10 17:31:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:31:10,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-10 17:31:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:10,639 INFO L225 Difference]: With dead ends: 779 [2024-11-10 17:31:10,639 INFO L226 Difference]: Without dead ends: 779 [2024-11-10 17:31:10,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:31:10,640 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 382 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:10,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 716 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:31:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-11-10 17:31:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 740. [2024-11-10 17:31:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 451 states have (on average 1.6829268292682926) internal successors, (759), 734 states have internal predecessors, (759), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:31:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 785 transitions. [2024-11-10 17:31:10,652 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 785 transitions. Word has length 57 [2024-11-10 17:31:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:10,653 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 785 transitions. [2024-11-10 17:31:10,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 785 transitions. [2024-11-10 17:31:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 17:31:10,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:10,656 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] [2024-11-10 17:31:10,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-10 17:31:10,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:10,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:10,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:10,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1120094881, now seen corresponding path program 1 times [2024-11-10 17:31:10,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:10,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393053215] [2024-11-10 17:31:10,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:10,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:10,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:10,860 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:10,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-10 17:31:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:11,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:31:11,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:11,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:31:11,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:31:11,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 17:31:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:11,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:31:11,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:11,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393053215] [2024-11-10 17:31:11,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393053215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:11,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:11,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:31:11,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535114819] [2024-11-10 17:31:11,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:11,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:31:11,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:11,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:31:11,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:31:11,096 INFO L87 Difference]: Start difference. First operand 740 states and 785 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:12,251 INFO L93 Difference]: Finished difference Result 739 states and 784 transitions. [2024-11-10 17:31:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:31:12,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 62 [2024-11-10 17:31:12,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:12,255 INFO L225 Difference]: With dead ends: 739 [2024-11-10 17:31:12,255 INFO L226 Difference]: Without dead ends: 739 [2024-11-10 17:31:12,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:31:12,255 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 2 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:12,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1903 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:31:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-10 17:31:12,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2024-11-10 17:31:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 451 states have (on average 1.680709534368071) internal successors, (758), 733 states have internal predecessors, (758), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:31:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 784 transitions. [2024-11-10 17:31:12,266 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 784 transitions. Word has length 62 [2024-11-10 17:31:12,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:12,266 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 784 transitions. [2024-11-10 17:31:12,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 784 transitions. [2024-11-10 17:31:12,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 17:31:12,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:12,268 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] [2024-11-10 17:31:12,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-10 17:31:12,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:12,468 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:12,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1120094880, now seen corresponding path program 1 times [2024-11-10 17:31:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:12,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919620160] [2024-11-10 17:31:12,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:12,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:12,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:12,470 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:12,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-10 17:31:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:12,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 17:31:12,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:12,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:31:12,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:31:12,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:31:12,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-10 17:31:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:12,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:31:12,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:12,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919620160] [2024-11-10 17:31:12,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919620160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:12,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:12,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:31:12,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830768660] [2024-11-10 17:31:12,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:12,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:31:12,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:12,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:31:12,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:31:12,757 INFO L87 Difference]: Start difference. First operand 739 states and 784 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:14,188 INFO L93 Difference]: Finished difference Result 738 states and 783 transitions. [2024-11-10 17:31:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:31:14,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 62 [2024-11-10 17:31:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:14,191 INFO L225 Difference]: With dead ends: 738 [2024-11-10 17:31:14,191 INFO L226 Difference]: Without dead ends: 738 [2024-11-10 17:31:14,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:31:14,192 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 1 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:14,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1937 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:31:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-10 17:31:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2024-11-10 17:31:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 450 states have (on average 1.6822222222222223) internal successors, (757), 732 states have internal predecessors, (757), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:31:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 783 transitions. [2024-11-10 17:31:14,202 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 783 transitions. Word has length 62 [2024-11-10 17:31:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:14,202 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 783 transitions. [2024-11-10 17:31:14,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:31:14,203 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 783 transitions. [2024-11-10 17:31:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 17:31:14,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:14,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:31:14,212 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-10 17:31:14,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:14,404 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr326REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:14,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:14,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1460615516, now seen corresponding path program 1 times [2024-11-10 17:31:14,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:14,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89782714] [2024-11-10 17:31:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:14,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:14,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:14,407 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:14,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-10 17:31:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:14,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:31:14,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:14,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:31:14,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89782714] [2024-11-10 17:31:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89782714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:31:14,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:31:14,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:31:14,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812425068] [2024-11-10 17:31:14,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:31:14,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:31:14,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:14,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:31:14,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:31:14,651 INFO L87 Difference]: Start difference. First operand 738 states and 783 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:31:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:14,685 INFO L93 Difference]: Finished difference Result 741 states and 787 transitions. [2024-11-10 17:31:14,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:31:14,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 70 [2024-11-10 17:31:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:14,689 INFO L225 Difference]: With dead ends: 741 [2024-11-10 17:31:14,689 INFO L226 Difference]: Without dead ends: 741 [2024-11-10 17:31:14,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:31:14,690 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 0 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:14,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2182 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:31:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-10 17:31:14,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2024-11-10 17:31:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 452 states have (on average 1.6814159292035398) internal successors, (760), 735 states have internal predecessors, (760), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-10 17:31:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 787 transitions. [2024-11-10 17:31:14,703 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 787 transitions. Word has length 70 [2024-11-10 17:31:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:14,703 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 787 transitions. [2024-11-10 17:31:14,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:31:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 787 transitions. [2024-11-10 17:31:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 17:31:14,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:14,705 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] [2024-11-10 17:31:14,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-10 17:31:14,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:14,906 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr326REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:14,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:14,906 INFO L85 PathProgramCache]: Analyzing trace with hash 417604096, now seen corresponding path program 1 times [2024-11-10 17:31:14,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:14,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205081083] [2024-11-10 17:31:14,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:31:14,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:14,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:14,908 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:14,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-10 17:31:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:31:15,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:31:15,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:15,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:31:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:15,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:15,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205081083] [2024-11-10 17:31:15,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205081083] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:31:15,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:31:15,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 17:31:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778716252] [2024-11-10 17:31:15,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:31:15,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 17:31:15,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:15,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 17:31:15,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:31:15,240 INFO L87 Difference]: Start difference. First operand 741 states and 787 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:31:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:15,333 INFO L93 Difference]: Finished difference Result 753 states and 804 transitions. [2024-11-10 17:31:15,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:31:15,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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 71 [2024-11-10 17:31:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:15,336 INFO L225 Difference]: With dead ends: 753 [2024-11-10 17:31:15,336 INFO L226 Difference]: Without dead ends: 753 [2024-11-10 17:31:15,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-10 17:31:15,337 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 8 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2185 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-10 17:31:15,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2185 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:31:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-10 17:31:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 751. [2024-11-10 17:31:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 461 states have (on average 1.6811279826464207) internal successors, (775), 744 states have internal predecessors, (775), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-10 17:31:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 802 transitions. [2024-11-10 17:31:15,349 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 802 transitions. Word has length 71 [2024-11-10 17:31:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:15,349 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 802 transitions. [2024-11-10 17:31:15,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:31:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 802 transitions. [2024-11-10 17:31:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 17:31:15,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:15,353 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] [2024-11-10 17:31:15,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-10 17:31:15,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:15,553 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr326REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:15,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:15,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1722400164, now seen corresponding path program 2 times [2024-11-10 17:31:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:15,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231249224] [2024-11-10 17:31:15,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:31:15,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:15,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:15,557 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:15,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-10 17:31:15,859 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 17:31:15,859 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:31:15,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:31:15,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:15,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:31:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:16,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:16,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231249224] [2024-11-10 17:31:16,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231249224] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:31:16,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:31:16,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 17:31:16,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378620194] [2024-11-10 17:31:16,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:31:16,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:31:16,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:16,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:31:16,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:31:16,037 INFO L87 Difference]: Start difference. First operand 751 states and 802 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:31:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:16,354 INFO L93 Difference]: Finished difference Result 766 states and 824 transitions. [2024-11-10 17:31:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 17:31:16,354 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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 74 [2024-11-10 17:31:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:16,356 INFO L225 Difference]: With dead ends: 766 [2024-11-10 17:31:16,356 INFO L226 Difference]: Without dead ends: 762 [2024-11-10 17:31:16,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 17:31:16,357 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 10 mSDsluCounter, 3633 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4362 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:16,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4362 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:31:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-10 17:31:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 760. [2024-11-10 17:31:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 470 states have (on average 1.674468085106383) internal successors, (787), 753 states have internal predecessors, (787), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-10 17:31:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 814 transitions. [2024-11-10 17:31:16,369 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 814 transitions. Word has length 74 [2024-11-10 17:31:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:16,369 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 814 transitions. [2024-11-10 17:31:16,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:31:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 814 transitions. [2024-11-10 17:31:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 17:31:16,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:16,370 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] [2024-11-10 17:31:16,379 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-10 17:31:16,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:16,571 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr326REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:16,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:16,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1485742116, now seen corresponding path program 3 times [2024-11-10 17:31:16,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:16,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584998437] [2024-11-10 17:31:16,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:31:16,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:16,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:16,575 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:16,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-10 17:31:17,070 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 17:31:17,070 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:31:17,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 17:31:17,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:17,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:31:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:17,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:17,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584998437] [2024-11-10 17:31:17,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584998437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:31:17,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:31:17,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 17:31:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496065279] [2024-11-10 17:31:17,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:31:17,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:31:17,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:17,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:31:17,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 17:31:17,600 INFO L87 Difference]: Start difference. First operand 760 states and 814 transitions. Second operand has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:31:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:18,870 INFO L93 Difference]: Finished difference Result 784 states and 853 transitions. [2024-11-10 17:31:18,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 17:31:18,871 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 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 80 [2024-11-10 17:31:18,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:18,873 INFO L225 Difference]: With dead ends: 784 [2024-11-10 17:31:18,874 INFO L226 Difference]: Without dead ends: 778 [2024-11-10 17:31:18,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 17:31:18,875 INFO L432 NwaCegarLoop]: 730 mSDtfsCounter, 16 mSDsluCounter, 8723 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9453 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:18,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9453 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 17:31:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-11-10 17:31:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2024-11-10 17:31:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 488 states have (on average 1.6598360655737705) internal successors, (810), 771 states have internal predecessors, (810), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-10 17:31:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 837 transitions. [2024-11-10 17:31:18,887 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 837 transitions. Word has length 80 [2024-11-10 17:31:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:18,888 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 837 transitions. [2024-11-10 17:31:18,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:31:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 837 transitions. [2024-11-10 17:31:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:31:18,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:18,889 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] [2024-11-10 17:31:18,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-10 17:31:19,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:19,090 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr326REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:19,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash -738510116, now seen corresponding path program 4 times [2024-11-10 17:31:19,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:19,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502776503] [2024-11-10 17:31:19,091 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:31:19,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:19,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:19,094 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:19,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-10 17:31:19,461 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:31:19,461 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:31:19,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 17:31:19,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:19,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:31:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:31:20,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:20,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502776503] [2024-11-10 17:31:20,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502776503] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:31:20,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:31:20,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 17:31:20,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994493016] [2024-11-10 17:31:20,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:31:20,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 17:31:20,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:31:20,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 17:31:20,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 17:31:20,901 INFO L87 Difference]: Start difference. First operand 778 states and 837 transitions. Second operand has 50 states, 50 states have (on average 2.3) internal successors, (115), 50 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:31:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:31:25,376 INFO L93 Difference]: Finished difference Result 818 states and 909 transitions. [2024-11-10 17:31:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 17:31:25,377 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.3) internal successors, (115), 50 states have internal predecessors, (115), 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 92 [2024-11-10 17:31:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:31:25,380 INFO L225 Difference]: With dead ends: 818 [2024-11-10 17:31:25,380 INFO L226 Difference]: Without dead ends: 814 [2024-11-10 17:31:25,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 134 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-10 17:31:25,383 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 37 mSDsluCounter, 17425 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 18154 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:31:25,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 18154 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:31:25,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-11-10 17:31:25,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 812. [2024-11-10 17:31:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 522 states have (on average 1.6398467432950192) internal successors, (856), 805 states have internal predecessors, (856), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-10 17:31:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 883 transitions. [2024-11-10 17:31:25,395 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 883 transitions. Word has length 92 [2024-11-10 17:31:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:31:25,395 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 883 transitions. [2024-11-10 17:31:25,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.3) internal successors, (115), 50 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:31:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 883 transitions. [2024-11-10 17:31:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-10 17:31:25,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:31:25,397 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] [2024-11-10 17:31:25,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-10 17:31:25,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:25,598 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr326REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:31:25,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:31:25,598 INFO L85 PathProgramCache]: Analyzing trace with hash -498262948, now seen corresponding path program 5 times [2024-11-10 17:31:25,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:31:25,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508504496] [2024-11-10 17:31:25,600 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:31:25,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:31:25,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:31:25,603 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:31:25,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-10 17:31:26,784 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-10 17:31:26,784 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:31:26,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-10 17:31:26,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:31:26,831 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-10 17:31:26,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-10 17:31:27,162 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-10 17:31:27,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-10 17:31:27,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:31:27,358 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 42 treesize of output 24 [2024-11-10 17:31:29,716 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:31:29,716 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 59 [2024-11-10 17:31:29,806 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 51 treesize of output 27 [2024-11-10 17:31:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 17:31:29,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:31:30,152 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1647) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2024-11-10 17:31:30,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:31:30,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508504496] [2024-11-10 17:31:30,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508504496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:31:30,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1806920920] [2024-11-10 17:31:30,154 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:31:30,154 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 17:31:30,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 17:31:30,155 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 17:31:30,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process