./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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_OAT_test7-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 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:11:26,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:11:26,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:11:26,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:11:26,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:11:26,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:11:26,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:11:26,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:11:26,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:11:26,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:11:26,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:11:26,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:11:26,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:11:26,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:11:26,196 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:11:26,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:11:26,196 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:11:26,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:11:26,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:11:26,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:11:26,197 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:11:26,199 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:11:26,199 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:11:26,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:11:26,199 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:11:26,199 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:11:26,199 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:11:26,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:11:26,200 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:11:26,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:11:26,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:11:26,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:11:26,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:11:26,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:11:26,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:11:26,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:11:26,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:11:26,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:11:26,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:11:26,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:11:26,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:11:26,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:11:26,203 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 -> 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b [2024-11-09 10:11:26,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:11:26,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:11:26,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:11:26,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:11:26,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:11:26,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2024-11-09 10:11:27,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:11:28,204 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:11:28,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2024-11-09 10:11:28,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499ee3502/85c83ed7da2846d682f416f6705da98a/FLAGad87af028 [2024-11-09 10:11:28,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499ee3502/85c83ed7da2846d682f416f6705da98a [2024-11-09 10:11:28,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:11:28,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:11:28,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:11:28,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:11:28,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:11:28,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:11:28" (1/1) ... [2024-11-09 10:11:28,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:28, skipping insertion in model container [2024-11-09 10:11:28,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:11:28" (1/1) ... [2024-11-09 10:11:28,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:11:28,655 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,681 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,688 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,693 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,702 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,727 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,728 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,730 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,731 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,734 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,735 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,736 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,737 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,740 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,740 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,742 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,743 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,743 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,744 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,747 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:28,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:11:28,774 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-09 10:11:28,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@469ed1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:28, skipping insertion in model container [2024-11-09 10:11:28,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:11:28,776 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:11:28,777 INFO L158 Benchmark]: Toolchain (without parser) took 532.03ms. Allocated memory was 130.0MB in the beginning and 195.0MB in the end (delta: 65.0MB). Free memory was 58.5MB in the beginning and 149.5MB in the end (delta: -90.9MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-11-09 10:11:28,778 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:11:28,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.60ms. Allocated memory was 130.0MB in the beginning and 195.0MB in the end (delta: 65.0MB). Free memory was 58.3MB in the beginning and 149.5MB in the end (delta: -91.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-11-09 10:11:28,779 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 528.60ms. Allocated memory was 130.0MB in the beginning and 195.0MB in the end (delta: 65.0MB). Free memory was 58.3MB in the beginning and 149.5MB in the end (delta: -91.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: 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_OAT_test7-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 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:11:30,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:11:30,715 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:11:30,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:11:30,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:11:30,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:11:30,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:11:30,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:11:30,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:11:30,748 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:11:30,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:11:30,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:11:30,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:11:30,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:11:30,749 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:11:30,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:11:30,750 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:11:30,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:11:30,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:11:30,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:11:30,751 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:11:30,751 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:11:30,752 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:11:30,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:11:30,752 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:11:30,752 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:11:30,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:11:30,753 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:11:30,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:11:30,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:11:30,754 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:11:30,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:11:30,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:11:30,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:11:30,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:11:30,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:11:30,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:11:30,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:11:30,756 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:11:30,756 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:11:30,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:11:30,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:11:30,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:11:30,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:11:30,760 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 -> 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b [2024-11-09 10:11:31,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:11:31,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:11:31,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:11:31,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:11:31,021 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:11:31,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2024-11-09 10:11:32,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:11:32,793 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:11:32,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2024-11-09 10:11:32,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05af78ef5/52a80965be7648bcadd29a6eb9e9d2d9/FLAGb1ab0e431 [2024-11-09 10:11:33,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05af78ef5/52a80965be7648bcadd29a6eb9e9d2d9 [2024-11-09 10:11:33,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:11:33,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:11:33,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:11:33,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:11:33,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:11:33,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:33,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19bac159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33, skipping insertion in model container [2024-11-09 10:11:33,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:33,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:11:33,431 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,476 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,480 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,486 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,493 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,535 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,536 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,538 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,542 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,544 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,547 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,548 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,549 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,552 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,558 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,559 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,564 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,565 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,565 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,568 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:11:33,595 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:11:33,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:11:33,628 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,648 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,649 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,655 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,659 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,674 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,675 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,676 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,677 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,681 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,682 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,682 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,683 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,690 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,694 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,695 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,695 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,696 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,700 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,703 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:11:33,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:11:33,713 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:11:33,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:11:33,847 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:11:33,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33 WrapperNode [2024-11-09 10:11:33,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:11:33,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:11:33,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:11:33,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:11:33,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:33,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:33,958 INFO L138 Inliner]: procedures = 179, calls = 323, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1204 [2024-11-09 10:11:33,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:11:33,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:11:33,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:11:33,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:11:33,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:33,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:33,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:34,049 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 265, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-11-09 10:11:34,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:34,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:34,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:34,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:34,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:34,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:34,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:11:34,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:11:34,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:11:34,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:11:34,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33" (1/1) ... [2024-11-09 10:11:34,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:11:34,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:11:34,140 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-09 10:11:34,142 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-09 10:11:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 10:11:34,176 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 10:11:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 10:11:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 10:11:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 10:11:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:11:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:11:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:11:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:11:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:11:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:11:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:11:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:11:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:11:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:11:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:11:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:11:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:11:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:11:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:11:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:11:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:11:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:11:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:11:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:11:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:11:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:11:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:11:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:11:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:11:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:11:34,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:11:34,367 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:11:34,369 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:11:34,388 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:11:34,419 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:11:34,439 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:11:37,596 INFO L? ?]: Removed 1295 outVars from TransFormulas that were not future-live. [2024-11-09 10:11:37,596 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:11:37,619 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:11:37,619 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-09 10:11:37,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:11:37 BoogieIcfgContainer [2024-11-09 10:11:37,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:11:37,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:11:37,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:11:37,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:11:37,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:11:33" (1/3) ... [2024-11-09 10:11:37,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1895c510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:11:37, skipping insertion in model container [2024-11-09 10:11:37,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:11:33" (2/3) ... [2024-11-09 10:11:37,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1895c510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:11:37, skipping insertion in model container [2024-11-09 10:11:37,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:11:37" (3/3) ... [2024-11-09 10:11:37,626 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test7-2.i [2024-11-09 10:11:37,639 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:11:37,640 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-09 10:11:37,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:11:37,700 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;@483c79e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:11:37,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-09 10:11:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 1253 states, 620 states have (on average 2.238709677419355) internal successors, (1388), 1246 states have internal predecessors, (1388), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:11:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:11:37,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:37,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:11:37,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:37,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-09 10:11:37,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:37,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165349875] [2024-11-09 10:11:37,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:37,727 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-09 10:11:37,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:37,728 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-09 10:11:37,730 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-09 10:11:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:37,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:11:37,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:37,868 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-09 10:11:37,876 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-09 10:11:37,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:37,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:37,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165349875] [2024-11-09 10:11:37,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165349875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:37,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:37,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:11:37,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889414873] [2024-11-09 10:11:37,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:37,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:11:37,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:37,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:11:37,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:11:37,903 INFO L87 Difference]: Start difference. First operand has 1253 states, 620 states have (on average 2.238709677419355) internal successors, (1388), 1246 states have internal predecessors, (1388), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 10:11:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:39,375 INFO L93 Difference]: Finished difference Result 1423 states and 1499 transitions. [2024-11-09 10:11:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:11:39,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 10:11:39,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:39,391 INFO L225 Difference]: With dead ends: 1423 [2024-11-09 10:11:39,391 INFO L226 Difference]: Without dead ends: 1421 [2024-11-09 10:11:39,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 10:11:39,395 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1150 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:39,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 908 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:11:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2024-11-09 10:11:39,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1234. [2024-11-09 10:11:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 620 states have (on average 2.085483870967742) internal successors, (1293), 1228 states have internal predecessors, (1293), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1301 transitions. [2024-11-09 10:11:39,459 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1301 transitions. Word has length 3 [2024-11-09 10:11:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:39,459 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1301 transitions. [2024-11-09 10:11:39,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 10:11:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1301 transitions. [2024-11-09 10:11:39,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:11:39,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:39,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:11:39,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 10:11:39,662 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-09 10:11:39,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:39,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:39,664 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-09 10:11:39,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:39,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962787767] [2024-11-09 10:11:39,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:39,665 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-09 10:11:39,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:39,668 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-09 10:11:39,669 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-09 10:11:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:39,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:11:39,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:39,811 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-09 10:11:39,822 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-09 10:11:39,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:39,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:39,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962787767] [2024-11-09 10:11:39,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962787767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:39,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:39,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:11:39,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471378211] [2024-11-09 10:11:39,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:39,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:11:39,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:39,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:11:39,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:11:39,826 INFO L87 Difference]: Start difference. First operand 1234 states and 1301 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 10:11:42,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:42,079 INFO L93 Difference]: Finished difference Result 1832 states and 1942 transitions. [2024-11-09 10:11:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:11:42,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 10:11:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:42,095 INFO L225 Difference]: With dead ends: 1832 [2024-11-09 10:11:42,095 INFO L226 Difference]: Without dead ends: 1832 [2024-11-09 10:11:42,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 10:11:42,097 INFO L432 NwaCegarLoop]: 1009 mSDtfsCounter, 638 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:42,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1692 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 10:11:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2024-11-09 10:11:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1443. [2024-11-09 10:11:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 830 states have (on average 2.067469879518072) internal successors, (1716), 1437 states have internal predecessors, (1716), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1724 transitions. [2024-11-09 10:11:42,127 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1724 transitions. Word has length 3 [2024-11-09 10:11:42,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:42,128 INFO L471 AbstractCegarLoop]: Abstraction has 1443 states and 1724 transitions. [2024-11-09 10:11:42,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 10:11:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1724 transitions. [2024-11-09 10:11:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 10:11:42,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:42,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:42,132 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-09 10:11:42,331 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-09 10:11:42,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:42,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-09 10:11:42,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:42,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636926785] [2024-11-09 10:11:42,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:42,333 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-09 10:11:42,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:42,336 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-09 10:11:42,337 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-09 10:11:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:42,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:11:42,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:42,476 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-09 10:11:42,481 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-09 10:11:42,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:11:42,545 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-09 10:11:42,570 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:11:42,570 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-09 10:11:42,590 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-09 10:11:42,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:42,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:42,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636926785] [2024-11-09 10:11:42,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636926785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:42,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:42,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:11:42,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524353132] [2024-11-09 10:11:42,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:42,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:11:42,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:42,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:11:42,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:11:42,593 INFO L87 Difference]: Start difference. First operand 1443 states and 1724 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-09 10:11:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:44,740 INFO L93 Difference]: Finished difference Result 1624 states and 1916 transitions. [2024-11-09 10:11:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:11:44,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-09 10:11:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:44,762 INFO L225 Difference]: With dead ends: 1624 [2024-11-09 10:11:44,762 INFO L226 Difference]: Without dead ends: 1624 [2024-11-09 10:11:44,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09 10:11:44,764 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 2587 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:44,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2590 Valid, 523 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:11:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2024-11-09 10:11:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1222. [2024-11-09 10:11:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 620 states have (on average 2.064516129032258) internal successors, (1280), 1216 states have internal predecessors, (1280), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1288 transitions. [2024-11-09 10:11:44,784 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1288 transitions. Word has length 7 [2024-11-09 10:11:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:44,787 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1288 transitions. [2024-11-09 10:11:44,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-09 10:11:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1288 transitions. [2024-11-09 10:11:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:11:44,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:44,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:44,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:11:44,988 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-09 10:11:44,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:44,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:44,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-09 10:11:44,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:44,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586177426] [2024-11-09 10:11:44,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:44,993 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-09 10:11:44,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:44,996 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-09 10:11:44,997 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-09 10:11:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:45,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:11:45,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:45,097 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-09 10:11:45,115 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-09 10:11:45,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:45,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:45,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586177426] [2024-11-09 10:11:45,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586177426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:45,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:45,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:11:45,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661531487] [2024-11-09 10:11:45,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:45,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:11:45,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:45,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:11:45,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:11:45,117 INFO L87 Difference]: Start difference. First operand 1222 states and 1288 transitions. Second operand has 3 states, 2 states have (on average 4.0) 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-09 10:11:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:47,151 INFO L93 Difference]: Finished difference Result 1694 states and 1797 transitions. [2024-11-09 10:11:47,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:11:47,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) 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-09 10:11:47,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:47,161 INFO L225 Difference]: With dead ends: 1694 [2024-11-09 10:11:47,161 INFO L226 Difference]: Without dead ends: 1694 [2024-11-09 10:11:47,161 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-09 10:11:47,162 INFO L432 NwaCegarLoop]: 1376 mSDtfsCounter, 692 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:47,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1899 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 10:11:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2024-11-09 10:11:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1249. [2024-11-09 10:11:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 657 states have (on average 2.051750380517504) internal successors, (1348), 1243 states have internal predecessors, (1348), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1356 transitions. [2024-11-09 10:11:47,190 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1356 transitions. Word has length 8 [2024-11-09 10:11:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:47,191 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1356 transitions. [2024-11-09 10:11:47,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) 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-09 10:11:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1356 transitions. [2024-11-09 10:11:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:11:47,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:47,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:47,199 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-09 10:11:47,392 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-09 10:11:47,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:47,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:47,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-09 10:11:47,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:47,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791155813] [2024-11-09 10:11:47,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:47,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:11:47,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:47,397 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-09 10:11:47,399 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-09 10:11:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:47,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:11:47,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:47,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:11:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:47,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:47,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:47,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791155813] [2024-11-09 10:11:47,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791155813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:47,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:47,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:11:47,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740264098] [2024-11-09 10:11:47,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:47,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:11:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:47,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:11:47,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:11:47,511 INFO L87 Difference]: Start difference. First operand 1249 states and 1356 transitions. Second operand has 3 states, 2 states have (on average 4.0) 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-09 10:11:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:48,732 INFO L93 Difference]: Finished difference Result 1584 states and 1717 transitions. [2024-11-09 10:11:48,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:11:48,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) 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-09 10:11:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:48,736 INFO L225 Difference]: With dead ends: 1584 [2024-11-09 10:11:48,736 INFO L226 Difference]: Without dead ends: 1584 [2024-11-09 10:11:48,737 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-09 10:11:48,737 INFO L432 NwaCegarLoop]: 1151 mSDtfsCounter, 925 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:48,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1498 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:11:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-11-09 10:11:48,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1202. [2024-11-09 10:11:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 657 states have (on average 1.974124809741248) internal successors, (1297), 1196 states have internal predecessors, (1297), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1305 transitions. [2024-11-09 10:11:48,755 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1305 transitions. Word has length 8 [2024-11-09 10:11:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:48,755 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1305 transitions. [2024-11-09 10:11:48,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) 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-09 10:11:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1305 transitions. [2024-11-09 10:11:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 10:11:48,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:48,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:48,760 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-09 10:11:48,959 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-09 10:11:48,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:48,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:48,960 INFO L85 PathProgramCache]: Analyzing trace with hash 422488225, now seen corresponding path program 1 times [2024-11-09 10:11:48,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:48,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438644062] [2024-11-09 10:11:48,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:48,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:11:48,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:48,963 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-09 10:11:48,964 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-09 10:11:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:49,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:11:49,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:49,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:49,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438644062] [2024-11-09 10:11:49,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438644062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:49,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:49,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:11:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918280652] [2024-11-09 10:11:49,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:49,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:11:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:49,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:11:49,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:11:49,116 INFO L87 Difference]: Start difference. First operand 1202 states and 1305 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:11:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:49,641 INFO L93 Difference]: Finished difference Result 1803 states and 1990 transitions. [2024-11-09 10:11:49,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:11:49,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 10:11:49,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:49,646 INFO L225 Difference]: With dead ends: 1803 [2024-11-09 10:11:49,646 INFO L226 Difference]: Without dead ends: 1803 [2024-11-09 10:11:49,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-09 10:11:49,646 INFO L432 NwaCegarLoop]: 1360 mSDtfsCounter, 636 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 3719 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:49,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 3719 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:11:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2024-11-09 10:11:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1452. [2024-11-09 10:11:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 907 states have (on average 1.9426681367144432) internal successors, (1762), 1446 states have internal predecessors, (1762), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1770 transitions. [2024-11-09 10:11:49,664 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1770 transitions. Word has length 13 [2024-11-09 10:11:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:49,664 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 1770 transitions. [2024-11-09 10:11:49,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:11:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1770 transitions. [2024-11-09 10:11:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 10:11:49,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:49,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:49,669 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-09 10:11:49,867 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-09 10:11:49,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:49,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:49,869 INFO L85 PathProgramCache]: Analyzing trace with hash -170511720, now seen corresponding path program 1 times [2024-11-09 10:11:49,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:49,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453125633] [2024-11-09 10:11:49,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:49,869 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-09 10:11:49,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:49,872 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-09 10:11:49,872 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-09 10:11:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:49,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:11:49,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:50,011 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-09 10:11:50,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:50,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:50,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453125633] [2024-11-09 10:11:50,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453125633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:50,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:50,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:11:50,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283699647] [2024-11-09 10:11:50,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:50,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:11:50,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:50,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:11:50,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:11:50,013 INFO L87 Difference]: Start difference. First operand 1452 states and 1770 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-09 10:11:50,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:50,035 INFO L93 Difference]: Finished difference Result 1392 states and 1684 transitions. [2024-11-09 10:11:50,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:11:50,035 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-09 10:11:50,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:50,038 INFO L225 Difference]: With dead ends: 1392 [2024-11-09 10:11:50,038 INFO L226 Difference]: Without dead ends: 1392 [2024-11-09 10:11:50,039 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-09 10:11:50,039 INFO L432 NwaCegarLoop]: 1168 mSDtfsCounter, 71 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2273 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-09 10:11:50,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2273 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:11:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2024-11-09 10:11:50,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1392. [2024-11-09 10:11:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 871 states have (on average 1.9242250287026406) internal successors, (1676), 1386 states have internal predecessors, (1676), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1684 transitions. [2024-11-09 10:11:50,054 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1684 transitions. Word has length 13 [2024-11-09 10:11:50,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:50,054 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1684 transitions. [2024-11-09 10:11:50,054 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-09 10:11:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1684 transitions. [2024-11-09 10:11:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 10:11:50,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:50,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:50,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-09 10:11:50,255 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-09 10:11:50,256 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:50,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:50,257 INFO L85 PathProgramCache]: Analyzing trace with hash -652980110, now seen corresponding path program 1 times [2024-11-09 10:11:50,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:50,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571900616] [2024-11-09 10:11:50,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:50,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:11:50,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:50,261 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-09 10:11:50,262 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-09 10:11:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:50,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:11:50,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:50,376 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-09 10:11:50,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:50,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571900616] [2024-11-09 10:11:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571900616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:50,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:50,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:11:50,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646823519] [2024-11-09 10:11:50,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:50,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:11:50,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:50,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:11:50,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:11:50,378 INFO L87 Difference]: Start difference. First operand 1392 states and 1684 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-09 10:11:50,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:50,428 INFO L93 Difference]: Finished difference Result 1362 states and 1626 transitions. [2024-11-09 10:11:50,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:11:50,429 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-09 10:11:50,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:50,431 INFO L225 Difference]: With dead ends: 1362 [2024-11-09 10:11:50,431 INFO L226 Difference]: Without dead ends: 1362 [2024-11-09 10:11:50,432 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-09 10:11:50,432 INFO L432 NwaCegarLoop]: 1123 mSDtfsCounter, 48 mSDsluCounter, 2220 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3343 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-09 10:11:50,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3343 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:11:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2024-11-09 10:11:50,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2024-11-09 10:11:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 855 states have (on average 1.8923976608187134) internal successors, (1618), 1356 states have internal predecessors, (1618), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1626 transitions. [2024-11-09 10:11:50,446 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1626 transitions. Word has length 15 [2024-11-09 10:11:50,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:50,446 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1626 transitions. [2024-11-09 10:11:50,446 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-09 10:11:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1626 transitions. [2024-11-09 10:11:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 10:11:50,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:50,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:50,456 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-09 10:11:50,650 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-09 10:11:50,650 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr626ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:50,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:50,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1566997286, now seen corresponding path program 1 times [2024-11-09 10:11:50,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:50,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669914027] [2024-11-09 10:11:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:50,651 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-09 10:11:50,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:50,653 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-09 10:11:50,654 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-09 10:11:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:50,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:11:50,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:50,794 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:11:50,795 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:11:50,799 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 33 treesize of output 31 [2024-11-09 10:11:50,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:11:50,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-11-09 10:11:50,858 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-09 10:11:50,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:50,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:50,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669914027] [2024-11-09 10:11:50,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669914027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:50,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:50,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:11:50,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602307644] [2024-11-09 10:11:50,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:50,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:11:50,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:50,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:11:50,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:11:50,861 INFO L87 Difference]: Start difference. First operand 1362 states and 1626 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-09 10:11:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:51,060 INFO L93 Difference]: Finished difference Result 2400 states and 2762 transitions. [2024-11-09 10:11:51,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:11:51,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-11-09 10:11:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:51,066 INFO L225 Difference]: With dead ends: 2400 [2024-11-09 10:11:51,066 INFO L226 Difference]: Without dead ends: 2400 [2024-11-09 10:11:51,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-09 10:11:51,067 INFO L432 NwaCegarLoop]: 1125 mSDtfsCounter, 1078 mSDsluCounter, 2241 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:51,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 3366 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:11:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2024-11-09 10:11:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1361. [2024-11-09 10:11:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 854 states have (on average 1.8922716627634661) internal successors, (1616), 1355 states have internal predecessors, (1616), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1624 transitions. [2024-11-09 10:11:51,085 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1624 transitions. Word has length 16 [2024-11-09 10:11:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:51,085 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1624 transitions. [2024-11-09 10:11:51,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-09 10:11:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1624 transitions. [2024-11-09 10:11:51,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 10:11:51,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:51,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:51,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 10:11:51,287 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-09 10:11:51,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:51,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:51,288 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-09 10:11:51,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:51,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654926794] [2024-11-09 10:11:51,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:51,288 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-09 10:11:51,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:51,291 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-09 10:11:51,295 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-09 10:11:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:51,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:11:51,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:51,459 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-09 10:11:51,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:51,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:51,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654926794] [2024-11-09 10:11:51,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654926794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:51,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:51,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:11:51,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615698595] [2024-11-09 10:11:51,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:51,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:11:51,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:51,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:11:51,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:11:51,461 INFO L87 Difference]: Start difference. First operand 1361 states and 1624 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:11:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:51,484 INFO L93 Difference]: Finished difference Result 1301 states and 1538 transitions. [2024-11-09 10:11:51,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:11:51,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 10:11:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:51,488 INFO L225 Difference]: With dead ends: 1301 [2024-11-09 10:11:51,488 INFO L226 Difference]: Without dead ends: 1301 [2024-11-09 10:11:51,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-09 10:11:51,488 INFO L432 NwaCegarLoop]: 1090 mSDtfsCounter, 71 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2117 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-09 10:11:51,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2117 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:11:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2024-11-09 10:11:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1301. [2024-11-09 10:11:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 818 states have (on average 1.8704156479217604) internal successors, (1530), 1295 states have internal predecessors, (1530), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1538 transitions. [2024-11-09 10:11:51,504 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1538 transitions. Word has length 18 [2024-11-09 10:11:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:51,504 INFO L471 AbstractCegarLoop]: Abstraction has 1301 states and 1538 transitions. [2024-11-09 10:11:51,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:11:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1538 transitions. [2024-11-09 10:11:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 10:11:51,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:51,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:51,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 10:11:51,705 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-09 10:11:51,706 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:51,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:51,707 INFO L85 PathProgramCache]: Analyzing trace with hash 582665080, now seen corresponding path program 1 times [2024-11-09 10:11:51,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:51,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23390951] [2024-11-09 10:11:51,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:51,708 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-09 10:11:51,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:51,710 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-09 10:11:51,711 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-09 10:11:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:51,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:11:51,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:51,877 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-09 10:11:51,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:51,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:51,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23390951] [2024-11-09 10:11:51,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23390951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:51,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:51,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:11:51,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86509427] [2024-11-09 10:11:51,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:51,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:11:51,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:51,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:11:51,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:11:51,879 INFO L87 Difference]: Start difference. First operand 1301 states and 1538 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-09 10:11:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:51,938 INFO L93 Difference]: Finished difference Result 1271 states and 1480 transitions. [2024-11-09 10:11:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:11:51,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-09 10:11:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:51,943 INFO L225 Difference]: With dead ends: 1271 [2024-11-09 10:11:51,944 INFO L226 Difference]: Without dead ends: 1271 [2024-11-09 10:11:51,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-09 10:11:51,944 INFO L432 NwaCegarLoop]: 1045 mSDtfsCounter, 48 mSDsluCounter, 2064 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3109 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-09 10:11:51,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3109 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:11:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2024-11-09 10:11:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2024-11-09 10:11:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 802 states have (on average 1.8354114713216958) internal successors, (1472), 1265 states have internal predecessors, (1472), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1480 transitions. [2024-11-09 10:11:51,958 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1480 transitions. Word has length 20 [2024-11-09 10:11:51,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:51,959 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1480 transitions. [2024-11-09 10:11:51,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-09 10:11:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1480 transitions. [2024-11-09 10:11:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 10:11:51,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:51,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:51,967 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-09 10:11:52,161 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-09 10:11:52,162 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:52,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:52,163 INFO L85 PathProgramCache]: Analyzing trace with hash -195006074, now seen corresponding path program 1 times [2024-11-09 10:11:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:52,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942077505] [2024-11-09 10:11:52,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:52,164 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-09 10:11:52,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:52,167 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-09 10:11:52,168 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-09 10:11:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:52,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:11:52,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:52,342 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-09 10:11:52,434 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-09 10:11:52,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:52,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:52,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942077505] [2024-11-09 10:11:52,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942077505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:52,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:52,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:11:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373999063] [2024-11-09 10:11:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:52,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:11:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:52,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:11:52,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:11:52,435 INFO L87 Difference]: Start difference. First operand 1271 states and 1480 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-09 10:11:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:54,088 INFO L93 Difference]: Finished difference Result 1667 states and 1989 transitions. [2024-11-09 10:11:54,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:11:54,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-09 10:11:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:54,092 INFO L225 Difference]: With dead ends: 1667 [2024-11-09 10:11:54,093 INFO L226 Difference]: Without dead ends: 1667 [2024-11-09 10:11:54,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-09 10:11:54,093 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 780 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:54,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 1476 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 10:11:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-11-09 10:11:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1267. [2024-11-09 10:11:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 802 states have (on average 1.825436408977556) internal successors, (1464), 1261 states have internal predecessors, (1464), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1472 transitions. [2024-11-09 10:11:54,107 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1472 transitions. Word has length 34 [2024-11-09 10:11:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:54,107 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1472 transitions. [2024-11-09 10:11:54,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-09 10:11:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1472 transitions. [2024-11-09 10:11:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 10:11:54,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:54,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:54,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 10:11:54,309 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-09 10:11:54,310 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:54,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:54,310 INFO L85 PathProgramCache]: Analyzing trace with hash -195006073, now seen corresponding path program 1 times [2024-11-09 10:11:54,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:54,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421026846] [2024-11-09 10:11:54,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:54,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:11:54,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:54,319 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-09 10:11:54,320 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-09 10:11:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:54,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:11:54,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:54,459 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-09 10:11:54,618 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-09 10:11:54,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:54,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:54,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421026846] [2024-11-09 10:11:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421026846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:54,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:54,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:11:54,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120587832] [2024-11-09 10:11:54,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:54,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:11:54,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:54,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:11:54,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:11:54,619 INFO L87 Difference]: Start difference. First operand 1267 states and 1472 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-09 10:11:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:56,641 INFO L93 Difference]: Finished difference Result 1784 states and 2083 transitions. [2024-11-09 10:11:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:11:56,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-09 10:11:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:56,646 INFO L225 Difference]: With dead ends: 1784 [2024-11-09 10:11:56,646 INFO L226 Difference]: Without dead ends: 1784 [2024-11-09 10:11:56,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-09 10:11:56,646 INFO L432 NwaCegarLoop]: 1270 mSDtfsCounter, 543 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 2529 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:56,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 2529 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 10:11:56,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2024-11-09 10:11:56,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1263. [2024-11-09 10:11:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 802 states have (on average 1.8154613466334164) internal successors, (1456), 1257 states have internal predecessors, (1456), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1464 transitions. [2024-11-09 10:11:56,672 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1464 transitions. Word has length 34 [2024-11-09 10:11:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:56,672 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1464 transitions. [2024-11-09 10:11:56,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-09 10:11:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1464 transitions. [2024-11-09 10:11:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 10:11:56,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:56,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:56,678 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-09 10:11:56,874 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-09 10:11:56,874 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:56,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1181697534, now seen corresponding path program 1 times [2024-11-09 10:11:56,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:56,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633793829] [2024-11-09 10:11:56,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:56,876 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-09 10:11:56,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:56,879 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-09 10:11:56,880 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-09 10:11:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:57,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:11:57,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:57,106 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-09 10:11:57,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:57,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:57,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633793829] [2024-11-09 10:11:57,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633793829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:57,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:57,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:11:57,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135072347] [2024-11-09 10:11:57,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:57,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:11:57,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:57,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:11:57,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:11:57,107 INFO L87 Difference]: Start difference. First operand 1263 states and 1464 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:11:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:57,148 INFO L93 Difference]: Finished difference Result 1251 states and 1444 transitions. [2024-11-09 10:11:57,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:11:57,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-09 10:11:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:57,151 INFO L225 Difference]: With dead ends: 1251 [2024-11-09 10:11:57,151 INFO L226 Difference]: Without dead ends: 1251 [2024-11-09 10:11:57,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:11:57,152 INFO L432 NwaCegarLoop]: 1039 mSDtfsCounter, 21 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3086 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-09 10:11:57,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3086 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:11:57,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2024-11-09 10:11:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2024-11-09 10:11:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 790 states have (on average 1.8177215189873417) internal successors, (1436), 1245 states have internal predecessors, (1436), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:11:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1444 transitions. [2024-11-09 10:11:57,189 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1444 transitions. Word has length 53 [2024-11-09 10:11:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:57,190 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1444 transitions. [2024-11-09 10:11:57,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:11:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1444 transitions. [2024-11-09 10:11:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 10:11:57,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:57,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:57,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 10:11:57,394 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-09 10:11:57,395 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:11:57,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1740051530, now seen corresponding path program 1 times [2024-11-09 10:11:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:11:57,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269065014] [2024-11-09 10:11:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:57,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:11:57,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:11:57,399 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-09 10:11:57,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 10:11:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:57,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:11:57,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:57,697 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-09 10:11:57,704 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-09 10:11:58,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:11:58,136 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-09 10:11:58,150 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:11:58,151 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-09 10:11:58,166 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-09 10:11:58,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:11:58,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:11:58,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269065014] [2024-11-09 10:11:58,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269065014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:58,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:58,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:11:58,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597557586] [2024-11-09 10:11:58,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:58,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:11:58,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:11:58,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:11:58,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:11:58,170 INFO L87 Difference]: Start difference. First operand 1251 states and 1444 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:00,116 INFO L93 Difference]: Finished difference Result 1605 states and 1915 transitions. [2024-11-09 10:12:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:00,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-09 10:12:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:00,121 INFO L225 Difference]: With dead ends: 1605 [2024-11-09 10:12:00,121 INFO L226 Difference]: Without dead ends: 1605 [2024-11-09 10:12:00,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 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-09 10:12:00,121 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 1049 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:00,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 803 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:12:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-11-09 10:12:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1176. [2024-11-09 10:12:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 753 states have (on average 1.7583001328021248) internal successors, (1324), 1170 states have internal predecessors, (1324), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:12:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1332 transitions. [2024-11-09 10:12:00,132 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1332 transitions. Word has length 61 [2024-11-09 10:12:00,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:00,133 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1332 transitions. [2024-11-09 10:12:00,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1332 transitions. [2024-11-09 10:12:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 10:12:00,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:00,134 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] [2024-11-09 10:12:00,141 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-09 10:12:00,337 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-09 10:12:00,338 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:12:00,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454369, now seen corresponding path program 1 times [2024-11-09 10:12:00,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:00,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650578393] [2024-11-09 10:12:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:00,338 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-09 10:12:00,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:00,341 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-09 10:12:00,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 10:12:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:00,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:12:00,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:00,557 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-09 10:12:00,568 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-09 10:12:00,582 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-09 10:12:00,589 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-09 10:12:00,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:00,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:00,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650578393] [2024-11-09 10:12:00,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650578393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:00,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:00,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:00,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812280552] [2024-11-09 10:12:00,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:00,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:12:00,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:00,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:12:00,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:12:00,590 INFO L87 Difference]: Start difference. First operand 1176 states and 1332 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-09 10:12:02,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:02,333 INFO L93 Difference]: Finished difference Result 1175 states and 1331 transitions. [2024-11-09 10:12:02,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:12:02,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-09 10:12:02,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:02,336 INFO L225 Difference]: With dead ends: 1175 [2024-11-09 10:12:02,337 INFO L226 Difference]: Without dead ends: 1175 [2024-11-09 10:12:02,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 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-09 10:12:02,337 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 2 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:02,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2591 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:12:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2024-11-09 10:12:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2024-11-09 10:12:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 753 states have (on average 1.7569721115537849) internal successors, (1323), 1169 states have internal predecessors, (1323), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:12:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1331 transitions. [2024-11-09 10:12:02,347 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1331 transitions. Word has length 66 [2024-11-09 10:12:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:02,348 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1331 transitions. [2024-11-09 10:12:02,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-09 10:12:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1331 transitions. [2024-11-09 10:12:02,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 10:12:02,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:02,349 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] [2024-11-09 10:12:02,356 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-09 10:12:02,552 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-09 10:12:02,553 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:12:02,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:02,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454368, now seen corresponding path program 1 times [2024-11-09 10:12:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:02,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963675430] [2024-11-09 10:12:02,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:02,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-09 10:12:02,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:02,555 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-09 10:12:02,556 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-09 10:12:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:02,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:12:02,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:02,805 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-09 10:12:02,823 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-09 10:12:02,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 10:12:02,895 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-09 10:12:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:12:02,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:02,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:02,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963675430] [2024-11-09 10:12:02,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963675430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:02,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:02,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:02,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465271748] [2024-11-09 10:12:02,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:02,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:12:02,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:02,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:12:02,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:12:02,948 INFO L87 Difference]: Start difference. First operand 1175 states and 1331 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-09 10:12:04,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:04,991 INFO L93 Difference]: Finished difference Result 1174 states and 1330 transitions. [2024-11-09 10:12:04,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:12:04,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-09 10:12:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:04,994 INFO L225 Difference]: With dead ends: 1174 [2024-11-09 10:12:04,994 INFO L226 Difference]: Without dead ends: 1174 [2024-11-09 10:12:04,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:12:04,995 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 1 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:04,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2645 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 10:12:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2024-11-09 10:12:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2024-11-09 10:12:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 752 states have (on average 1.7579787234042554) internal successors, (1322), 1168 states have internal predecessors, (1322), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:12:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1330 transitions. [2024-11-09 10:12:05,013 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1330 transitions. Word has length 66 [2024-11-09 10:12:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:05,014 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1330 transitions. [2024-11-09 10:12:05,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-09 10:12:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1330 transitions. [2024-11-09 10:12:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 10:12:05,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:05,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:05,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:05,219 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-09 10:12:05,220 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:12:05,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash 306171846, now seen corresponding path program 1 times [2024-11-09 10:12:05,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:05,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575377738] [2024-11-09 10:12:05,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:05,221 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-09 10:12:05,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:05,225 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-09 10:12:05,226 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-09 10:12:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:05,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:12:05,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:12:05,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:05,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:05,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575377738] [2024-11-09 10:12:05,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575377738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:05,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:05,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313774862] [2024-11-09 10:12:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:05,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:05,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:05,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:05,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:05,542 INFO L87 Difference]: Start difference. First operand 1174 states and 1330 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-09 10:12:05,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:05,570 INFO L93 Difference]: Finished difference Result 1177 states and 1334 transitions. [2024-11-09 10:12:05,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:05,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 74 [2024-11-09 10:12:05,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:05,577 INFO L225 Difference]: With dead ends: 1177 [2024-11-09 10:12:05,577 INFO L226 Difference]: Without dead ends: 1177 [2024-11-09 10:12:05,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 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-09 10:12:05,578 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 0 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3031 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-09 10:12:05,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3031 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:12:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2024-11-09 10:12:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1177. [2024-11-09 10:12:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 754 states have (on average 1.757294429708223) internal successors, (1325), 1171 states have internal predecessors, (1325), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:12:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1334 transitions. [2024-11-09 10:12:05,591 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1334 transitions. Word has length 74 [2024-11-09 10:12:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:05,591 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1334 transitions. [2024-11-09 10:12:05,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-09 10:12:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1334 transitions. [2024-11-09 10:12:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 10:12:05,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:05,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:05,611 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-09 10:12:05,800 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-09 10:12:05,801 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:12:05,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:05,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1639343584, now seen corresponding path program 1 times [2024-11-09 10:12:05,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:05,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351827810] [2024-11-09 10:12:05,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:05,802 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-09 10:12:05,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:05,805 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-09 10:12:05,807 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-09 10:12:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:06,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:12:06,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:06,094 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-09 10:12:06,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:06,217 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-09 10:12:06,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:06,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351827810] [2024-11-09 10:12:06,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351827810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:12:06,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:06,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 10:12:06,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749713573] [2024-11-09 10:12:06,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:06,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:12:06,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:06,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:12:06,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:12:06,218 INFO L87 Difference]: Start difference. First operand 1177 states and 1334 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-09 10:12:06,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:06,373 INFO L93 Difference]: Finished difference Result 1189 states and 1351 transitions. [2024-11-09 10:12:06,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:12:06,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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 75 [2024-11-09 10:12:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:06,376 INFO L225 Difference]: With dead ends: 1189 [2024-11-09 10:12:06,377 INFO L226 Difference]: Without dead ends: 1189 [2024-11-09 10:12:06,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 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-09 10:12:06,377 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 6 mSDsluCounter, 4034 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5046 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:06,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5046 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:12:06,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2024-11-09 10:12:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1187. [2024-11-09 10:12:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 763 states have (on average 1.7562254259501966) internal successors, (1340), 1180 states have internal predecessors, (1340), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:12:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1349 transitions. [2024-11-09 10:12:06,390 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1349 transitions. Word has length 75 [2024-11-09 10:12:06,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:06,390 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1349 transitions. [2024-11-09 10:12:06,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-09 10:12:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1349 transitions. [2024-11-09 10:12:06,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 10:12:06,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:06,391 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:06,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:06,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:12:06,592 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:12:06,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:06,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2042526138, now seen corresponding path program 2 times [2024-11-09 10:12:06,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:06,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131111991] [2024-11-09 10:12:06,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:12:06,593 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-09 10:12:06,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:06,594 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:12:06,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-09 10:12:07,044 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:12:07,045 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:12:07,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:12:07,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:07,113 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-09 10:12:07,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:07,271 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-09 10:12:07,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:07,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131111991] [2024-11-09 10:12:07,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131111991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:12:07,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:07,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 10:12:07,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907113375] [2024-11-09 10:12:07,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:07,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:12:07,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:07,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:12:07,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:12:07,273 INFO L87 Difference]: Start difference. First operand 1187 states and 1349 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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-09 10:12:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:07,606 INFO L93 Difference]: Finished difference Result 1202 states and 1371 transitions. [2024-11-09 10:12:07,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 10:12:07,607 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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 78 [2024-11-09 10:12:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:07,635 INFO L225 Difference]: With dead ends: 1202 [2024-11-09 10:12:07,635 INFO L226 Difference]: Without dead ends: 1198 [2024-11-09 10:12:07,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 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-09 10:12:07,637 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 14 mSDsluCounter, 6056 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 7068 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:07,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 7068 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:12:07,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-11-09 10:12:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1196. [2024-11-09 10:12:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 772 states have (on average 1.7512953367875648) internal successors, (1352), 1189 states have internal predecessors, (1352), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:12:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1361 transitions. [2024-11-09 10:12:07,666 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1361 transitions. Word has length 78 [2024-11-09 10:12:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:07,666 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1361 transitions. [2024-11-09 10:12:07,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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-09 10:12:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1361 transitions. [2024-11-09 10:12:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 10:12:07,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:07,667 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:07,684 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 (21)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:07,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:12:07,868 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:12:07,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:07,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1275035654, now seen corresponding path program 3 times [2024-11-09 10:12:07,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:07,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287419560] [2024-11-09 10:12:07,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:12:07,869 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-09 10:12:07,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:07,870 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:12:07,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-09 10:12:08,548 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 10:12:08,549 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:12:08,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:12:08,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:08,689 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-09 10:12:08,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:09,089 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-09 10:12:09,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:09,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287419560] [2024-11-09 10:12:09,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287419560] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:12:09,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:09,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 10:12:09,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123350111] [2024-11-09 10:12:09,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:09,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:12:09,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:09,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:12:09,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 10:12:09,091 INFO L87 Difference]: Start difference. First operand 1196 states and 1361 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 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-09 10:12:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:10,349 INFO L93 Difference]: Finished difference Result 1220 states and 1400 transitions. [2024-11-09 10:12:10,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 10:12:10,350 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 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 84 [2024-11-09 10:12:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:10,352 INFO L225 Difference]: With dead ends: 1220 [2024-11-09 10:12:10,352 INFO L226 Difference]: Without dead ends: 1214 [2024-11-09 10:12:10,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 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-09 10:12:10,354 INFO L432 NwaCegarLoop]: 1013 mSDtfsCounter, 22 mSDsluCounter, 11112 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12125 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:10,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12125 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:12:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2024-11-09 10:12:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2024-11-09 10:12:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 790 states have (on average 1.740506329113924) internal successors, (1375), 1207 states have internal predecessors, (1375), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:12:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1384 transitions. [2024-11-09 10:12:10,365 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1384 transitions. Word has length 84 [2024-11-09 10:12:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:10,365 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1384 transitions. [2024-11-09 10:12:10,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 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-09 10:12:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1384 transitions. [2024-11-09 10:12:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:12:10,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:10,366 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:10,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-09 10:12:10,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:12:10,570 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:12:10,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:10,571 INFO L85 PathProgramCache]: Analyzing trace with hash 304120710, now seen corresponding path program 4 times [2024-11-09 10:12:10,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:10,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800201438] [2024-11-09 10:12:10,572 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:12:10,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-09 10:12:10,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:10,573 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:12:10,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-09 10:12:10,977 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:12:10,977 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:12:11,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 10:12:11,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:11,371 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-09 10:12:11,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:12,529 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-09 10:12:12,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:12,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800201438] [2024-11-09 10:12:12,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800201438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:12:12,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:12,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 10:12:12,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403744735] [2024-11-09 10:12:12,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:12,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 10:12:12,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:12,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 10:12:12,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 10:12:12,533 INFO L87 Difference]: Start difference. First operand 1214 states and 1384 transitions. Second operand has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 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-09 10:12:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:17,133 INFO L93 Difference]: Finished difference Result 1254 states and 1456 transitions. [2024-11-09 10:12:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 10:12:17,134 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 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 96 [2024-11-09 10:12:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:17,136 INFO L225 Difference]: With dead ends: 1254 [2024-11-09 10:12:17,137 INFO L226 Difference]: Without dead ends: 1250 [2024-11-09 10:12:17,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 10:12:17,139 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 27 mSDsluCounter, 25224 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 26236 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:17,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 26236 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:12:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-09 10:12:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1248. [2024-11-09 10:12:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 824 states have (on average 1.7245145631067962) internal successors, (1421), 1241 states have internal predecessors, (1421), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:12:17,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1430 transitions. [2024-11-09 10:12:17,151 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1430 transitions. Word has length 96 [2024-11-09 10:12:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:17,152 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1430 transitions. [2024-11-09 10:12:17,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 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-09 10:12:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1430 transitions. [2024-11-09 10:12:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 10:12:17,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:17,153 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:17,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:17,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:12:17,354 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:12:17,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:17,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1029433158, now seen corresponding path program 5 times [2024-11-09 10:12:17,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:17,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602205875] [2024-11-09 10:12:17,355 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:12:17,355 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-09 10:12:17,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:17,357 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:12:17,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-09 10:12:18,525 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-09 10:12:18,525 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:12:18,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 10:12:18,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:18,565 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-09 10:12:18,679 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 10:12:18,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 10:12:18,701 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-09 10:12:18,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 10:12:19,540 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:19,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 10:12:19,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-09 10:12:19,599 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-09 10:12:19,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:19,937 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2026) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-09 10:12:19,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:19,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602205875] [2024-11-09 10:12:19,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602205875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:12:19,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1912464503] [2024-11-09 10:12:19,940 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:12:19,940 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 10:12:19,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 10:12:19,945 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 10:12:19,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process