./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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_test10-3.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 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:06:41,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:06:41,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:06:41,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:06:41,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:06:41,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:06:41,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:06:41,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:06:41,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:06:41,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:06:41,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:06:41,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:06:41,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:06:41,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:06:41,652 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:06:41,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:06:41,653 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:06:41,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:06:41,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:06:41,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:06:41,656 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:06:41,656 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:06:41,656 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:06:41,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:06:41,656 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:06:41,657 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:06:41,657 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:06:41,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:06:41,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:06:41,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:06:41,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:06:41,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:06:41,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:06:41,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:06:41,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:06:41,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:06:41,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:06:41,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:06:41,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:06:41,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:06:41,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:06:41,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:06:41,662 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 -> 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e [2024-11-22 21:06:41,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:06:41,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:06:41,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:06:41,839 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:06:41,840 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:06:41,841 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_test10-3.i [2024-11-22 21:06:43,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:06:43,561 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:06:43,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i [2024-11-22 21:06:43,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b609442b9/a9bb563e7b55488a8d861c583c951f5d/FLAGf722d3d79 [2024-11-22 21:06:43,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b609442b9/a9bb563e7b55488a8d861c583c951f5d [2024-11-22 21:06:43,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:06:43,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:06:43,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:06:43,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:06:43,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:06:43,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:06:43" (1/1) ... [2024-11-22 21:06:43,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1ca4b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:43, skipping insertion in model container [2024-11-22 21:06:43,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:06:43" (1/1) ... [2024-11-22 21:06:43,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:06:44,026 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-22 21:06:44,058 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-22 21:06:44,061 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-22 21:06:44,065 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-22 21:06:44,069 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-22 21:06:44,099 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-22 21:06:44,105 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-22 21:06:44,109 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-22 21:06:44,114 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-22 21:06:44,150 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-22 21:06:44,151 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-22 21:06:44,157 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-22 21:06:44,157 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-22 21:06:44,172 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-22 21:06:44,173 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-22 21:06:44,174 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-22 21:06:44,175 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-22 21:06:44,192 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-22 21:06:44,193 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-22 21:06:44,196 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-22 21:06:44,196 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-22 21:06:44,214 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-22 21:06:44,215 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-22 21:06:44,220 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-22 21:06:44,220 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-22 21:06:44,221 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-22 21:06:44,223 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-22 21:06:44,227 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-22 21:06:44,228 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-22 21:06:44,229 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-22 21:06:44,237 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-22 21:06:44,237 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-22 21:06:44,238 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-22 21:06:44,238 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-22 21:06:44,243 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-22 21:06:44,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:06:44,269 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-22 21:06:44,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@9500740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:44, skipping insertion in model container [2024-11-22 21:06:44,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:06:44,271 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 21:06:44,273 INFO L158 Benchmark]: Toolchain (without parser) took 660.36ms. Allocated memory is still 211.8MB. Free memory was 182.3MB in the beginning and 146.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-22 21:06:44,273 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 123.7MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:06:44,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 658.69ms. Allocated memory is still 211.8MB. Free memory was 182.3MB in the beginning and 146.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-22 21:06:44,275 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.12ms. Allocated memory is still 123.7MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 658.69ms. Allocated memory is still 211.8MB. Free memory was 182.3MB in the beginning and 146.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 760]: 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/current/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_test10-3.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 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:06:45,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:06:45,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:06:45,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:06:45,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:06:46,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:06:46,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:06:46,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:06:46,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:06:46,016 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:06:46,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:06:46,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:06:46,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:06:46,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:06:46,018 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:06:46,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:06:46,019 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:06:46,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:06:46,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:06:46,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:06:46,021 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:06:46,022 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:06:46,022 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:06:46,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:06:46,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:06:46,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:06:46,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:06:46,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:06:46,025 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:06:46,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:06:46,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:06:46,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:06:46,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:06:46,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:06:46,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:06:46,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:06:46,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:06:46,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:06:46,027 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:06:46,027 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:06:46,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:06:46,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:06:46,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:06:46,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:06:46,028 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 -> 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e [2024-11-22 21:06:46,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:06:46,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:06:46,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:06:46,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:06:46,337 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:06:46,338 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_test10-3.i [2024-11-22 21:06:47,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:06:47,954 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:06:47,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i [2024-11-22 21:06:47,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/071e052e3/0aca88cdba354541b78870b24d536fb7/FLAGed0af4e08 [2024-11-22 21:06:47,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/071e052e3/0aca88cdba354541b78870b24d536fb7 [2024-11-22 21:06:47,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:06:47,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:06:47,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:06:47,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:06:47,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:06:47,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:06:47" (1/1) ... [2024-11-22 21:06:47,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f991247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:47, skipping insertion in model container [2024-11-22 21:06:47,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:06:47" (1/1) ... [2024-11-22 21:06:48,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:06:48,444 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-22 21:06:48,478 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-22 21:06:48,484 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-22 21:06:48,490 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-22 21:06:48,494 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-22 21:06:48,511 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-22 21:06:48,513 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-22 21:06:48,514 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-22 21:06:48,517 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-22 21:06:48,534 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-22 21:06:48,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-22 21:06:48,540 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-22 21:06:48,540 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-22 21:06:48,567 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-22 21:06:48,567 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-22 21:06:48,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-22 21:06:48,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-22 21:06:48,597 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-22 21:06:48,598 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-22 21:06:48,599 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-22 21:06:48,599 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-22 21:06:48,615 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-22 21:06:48,619 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-22 21:06:48,621 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-22 21:06:48,625 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-22 21:06:48,626 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-22 21:06:48,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-22 21:06:48,629 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-22 21:06:48,633 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-22 21:06:48,634 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-22 21:06:48,637 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-22 21:06:48,641 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-22 21:06:48,641 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-22 21:06:48,642 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-22 21:06:48,644 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-22 21:06:48,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:06:48,678 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 21:06:48,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:06:48,709 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-22 21:06:48,724 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-22 21:06:48,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-22 21:06:48,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-22 21:06:48,738 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-22 21:06:48,764 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-22 21:06:48,765 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-22 21:06:48,767 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-22 21:06:48,773 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-22 21:06:48,806 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-22 21:06:48,806 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-22 21:06:48,808 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-22 21:06:48,808 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-22 21:06:48,816 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-22 21:06:48,820 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-22 21:06:48,821 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-22 21:06:48,821 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-22 21:06:48,830 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-22 21:06:48,830 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-22 21:06:48,831 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-22 21:06:48,831 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-22 21:06:48,838 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-22 21:06:48,841 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-22 21:06:48,846 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-22 21:06:48,847 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-22 21:06:48,847 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-22 21:06:48,848 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-22 21:06:48,849 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-22 21:06:48,849 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-22 21:06:48,849 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-22 21:06:48,851 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-22 21:06:48,855 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-22 21:06:48,855 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-22 21:06:48,856 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-22 21:06:48,857 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-22 21:06:48,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:06:48,872 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:06:48,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:06:49,007 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:06:49,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49 WrapperNode [2024-11-22 21:06:49,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:06:49,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:06:49,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:06:49,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:06:49,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49" (1/1) ... [2024-11-22 21:06:49,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49" (1/1) ... [2024-11-22 21:06:49,196 INFO L138 Inliner]: procedures = 180, calls = 606, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2586 [2024-11-22 21:06:49,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:06:49,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:06:49,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:06:49,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:06:49,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49" (1/1) ... [2024-11-22 21:06:49,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49" (1/1) ... [2024-11-22 21:06:49,221 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49" (1/1) ... [2024-11-22 21:06:49,354 INFO L175 MemorySlicer]: Split 574 memory accesses to 3 slices as follows [106, 2, 466]. 81 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 102 writes are split as follows [4, 0, 98]. [2024-11-22 21:06:49,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49" (1/1) ... [2024-11-22 21:06:49,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49" (1/1) ... [2024-11-22 21:06:49,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49" (1/1) ... [2024-11-22 21:06:49,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49" (1/1) ... [2024-11-22 21:06:49,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49" (1/1) ... [2024-11-22 21:06:49,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49" (1/1) ... [2024-11-22 21:06:49,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:06:49,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:06:49,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:06:49,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:06:49,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49" (1/1) ... [2024-11-22 21:06:49,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:06:49,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:06:49,527 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-22 21:06:49,537 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-22 21:06:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 21:06:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 21:06:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 21:06:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-22 21:06:49,571 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-22 21:06:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 21:06:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 21:06:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 21:06:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 21:06:49,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 21:06:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-22 21:06:49,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-22 21:06:49,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-22 21:06:49,572 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-22 21:06:49,572 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-22 21:06:49,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-22 21:06:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 21:06:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:06:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 21:06:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 21:06:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 21:06:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 21:06:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 21:06:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 21:06:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 21:06:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 21:06:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 21:06:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 21:06:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 21:06:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 21:06:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 21:06:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 21:06:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:06:49,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:06:49,853 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:06:49,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:06:49,907 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:06:49,927 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:06:49,946 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:06:55,599 INFO L? ?]: Removed 2434 outVars from TransFormulas that were not future-live. [2024-11-22 21:06:55,599 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:06:55,649 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:06:55,649 INFO L316 CfgBuilder]: Removed 168 assume(true) statements. [2024-11-22 21:06:55,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:06:55 BoogieIcfgContainer [2024-11-22 21:06:55,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:06:55,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:06:55,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:06:55,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:06:55,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:06:47" (1/3) ... [2024-11-22 21:06:55,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb8ef5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:06:55, skipping insertion in model container [2024-11-22 21:06:55,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:06:49" (2/3) ... [2024-11-22 21:06:55,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb8ef5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:06:55, skipping insertion in model container [2024-11-22 21:06:55,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:06:55" (3/3) ... [2024-11-22 21:06:55,657 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test10-3.i [2024-11-22 21:06:55,670 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:06:55,671 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1189 error locations. [2024-11-22 21:06:55,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:06:55,732 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;@435bd8e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:06:55,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1189 error locations. [2024-11-22 21:06:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 2457 states, 1256 states have (on average 2.200636942675159) internal successors, (2764), 2443 states have internal predecessors, (2764), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 21:06:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 21:06:55,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:06:55,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 21:06:55,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:06:55,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:06:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash 84472, now seen corresponding path program 1 times [2024-11-22 21:06:55,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:06:55,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434325289] [2024-11-22 21:06:55,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:06:55,757 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-22 21:06:55,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:06:55,760 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-22 21:06:55,761 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-22 21:06:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:06:55,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:06:55,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:06:55,956 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-22 21:06:55,971 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-22 21:06:55,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:06:55,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:06:55,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434325289] [2024-11-22 21:06:55,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434325289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:06:55,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:06:55,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:06:55,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885353577] [2024-11-22 21:06:55,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:06:56,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:06:56,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:06:56,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:06:56,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:06:56,073 INFO L87 Difference]: Start difference. First operand has 2457 states, 1256 states have (on average 2.200636942675159) internal successors, (2764), 2443 states have internal predecessors, (2764), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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-22 21:06:59,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:06:59,254 INFO L93 Difference]: Finished difference Result 3292 states and 3492 transitions. [2024-11-22 21:06:59,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:06:59,260 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-22 21:06:59,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:06:59,294 INFO L225 Difference]: With dead ends: 3292 [2024-11-22 21:06:59,294 INFO L226 Difference]: Without dead ends: 3290 [2024-11-22 21:06:59,295 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-22 21:06:59,299 INFO L432 NwaCegarLoop]: 1676 mSDtfsCounter, 2320 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2330 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:06:59,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2330 Valid, 2247 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-22 21:06:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2024-11-22 21:06:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 2601. [2024-11-22 21:06:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2601 states, 1428 states have (on average 2.03781512605042) internal successors, (2910), 2585 states have internal predecessors, (2910), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 21:06:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 2942 transitions. [2024-11-22 21:06:59,397 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 2942 transitions. Word has length 3 [2024-11-22 21:06:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:06:59,397 INFO L471 AbstractCegarLoop]: Abstraction has 2601 states and 2942 transitions. [2024-11-22 21:06:59,397 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-22 21:06:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 2942 transitions. [2024-11-22 21:06:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 21:06:59,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:06:59,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 21:06:59,403 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-22 21:06:59,598 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-22 21:06:59,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:06:59,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:06:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash 84473, now seen corresponding path program 1 times [2024-11-22 21:06:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:06:59,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452429895] [2024-11-22 21:06:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:06:59,601 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-22 21:06:59,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:06:59,603 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-22 21:06:59,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 21:06:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:06:59,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:06:59,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:06:59,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:06:59,782 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-22 21:06:59,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:06:59,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:06:59,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452429895] [2024-11-22 21:06:59,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452429895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:06:59,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:06:59,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:06:59,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805700937] [2024-11-22 21:06:59,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:06:59,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:06:59,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:06:59,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:06:59,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:06:59,786 INFO L87 Difference]: Start difference. First operand 2601 states and 2942 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-22 21:07:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:03,763 INFO L93 Difference]: Finished difference Result 3402 states and 3823 transitions. [2024-11-22 21:07:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:07:03,764 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-22 21:07:03,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:03,771 INFO L225 Difference]: With dead ends: 3402 [2024-11-22 21:07:03,772 INFO L226 Difference]: Without dead ends: 3402 [2024-11-22 21:07:03,772 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-22 21:07:03,773 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 875 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 3631 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:03,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 3631 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-22 21:07:03,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2024-11-22 21:07:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3074. [2024-11-22 21:07:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 1899 states have (on average 1.9931542917324907) internal successors, (3785), 3055 states have internal predecessors, (3785), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 21:07:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 3823 transitions. [2024-11-22 21:07:03,812 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 3823 transitions. Word has length 3 [2024-11-22 21:07:03,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:03,812 INFO L471 AbstractCegarLoop]: Abstraction has 3074 states and 3823 transitions. [2024-11-22 21:07:03,812 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-22 21:07:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 3823 transitions. [2024-11-22 21:07:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 21:07:03,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:03,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:03,818 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-22 21:07:04,015 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-22 21:07:04,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:04,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:04,016 INFO L85 PathProgramCache]: Analyzing trace with hash 703308354, now seen corresponding path program 1 times [2024-11-22 21:07:04,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:04,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592766654] [2024-11-22 21:07:04,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:04,017 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-22 21:07:04,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:04,020 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-22 21:07:04,020 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-22 21:07:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:04,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 21:07:04,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:04,184 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-22 21:07:04,188 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-22 21:07:04,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:07:04,240 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-22 21:07:04,261 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 21:07:04,262 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-22 21:07:04,293 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-22 21:07:04,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:04,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:04,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592766654] [2024-11-22 21:07:04,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592766654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:04,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:04,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:07:04,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460194679] [2024-11-22 21:07:04,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:04,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:04,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:04,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:04,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:04,296 INFO L87 Difference]: Start difference. First operand 3074 states and 3823 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-22 21:07:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:11,570 INFO L93 Difference]: Finished difference Result 5339 states and 6238 transitions. [2024-11-22 21:07:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:07:11,573 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-22 21:07:11,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:11,586 INFO L225 Difference]: With dead ends: 5339 [2024-11-22 21:07:11,586 INFO L226 Difference]: Without dead ends: 5339 [2024-11-22 21:07:11,586 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-22 21:07:11,589 INFO L432 NwaCegarLoop]: 1182 mSDtfsCounter, 2384 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 4325 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 3399 SdHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:11,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 3399 Invalid, 4350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4325 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-22 21:07:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5339 states. [2024-11-22 21:07:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5339 to 3794. [2024-11-22 21:07:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 2619 states have (on average 2.020236731576938) internal successors, (5291), 3769 states have internal predecessors, (5291), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5341 transitions. [2024-11-22 21:07:11,649 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5341 transitions. Word has length 7 [2024-11-22 21:07:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:11,650 INFO L471 AbstractCegarLoop]: Abstraction has 3794 states and 5341 transitions. [2024-11-22 21:07:11,650 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-22 21:07:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5341 transitions. [2024-11-22 21:07:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 21:07:11,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:11,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:11,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 21:07:11,851 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-22 21:07:11,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:11,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash 327722514, now seen corresponding path program 1 times [2024-11-22 21:07:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:11,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995210201] [2024-11-22 21:07:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:11,855 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-22 21:07:11,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:11,859 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-22 21:07:11,861 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-22 21:07:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:12,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:07:12,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:12,018 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-22 21:07:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:07:12,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:12,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:12,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995210201] [2024-11-22 21:07:12,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995210201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:12,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:12,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:07:12,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326620225] [2024-11-22 21:07:12,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:12,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:07:12,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:12,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:07:12,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:07:12,027 INFO L87 Difference]: Start difference. First operand 3794 states and 5341 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-22 21:07:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:14,535 INFO L93 Difference]: Finished difference Result 4506 states and 6011 transitions. [2024-11-22 21:07:14,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:07:14,536 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-22 21:07:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:14,547 INFO L225 Difference]: With dead ends: 4506 [2024-11-22 21:07:14,547 INFO L226 Difference]: Without dead ends: 4506 [2024-11-22 21:07:14,548 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-22 21:07:14,548 INFO L432 NwaCegarLoop]: 2413 mSDtfsCounter, 1920 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 3181 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:14,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 3181 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-22 21:07:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4506 states. [2024-11-22 21:07:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4506 to 3702. [2024-11-22 21:07:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3702 states, 2619 states have (on average 1.9381443298969072) internal successors, (5076), 3677 states have internal predecessors, (5076), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 5126 transitions. [2024-11-22 21:07:14,594 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 5126 transitions. Word has length 8 [2024-11-22 21:07:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:14,595 INFO L471 AbstractCegarLoop]: Abstraction has 3702 states and 5126 transitions. [2024-11-22 21:07:14,595 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-22 21:07:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 5126 transitions. [2024-11-22 21:07:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 21:07:14,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:14,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:14,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-22 21:07:14,798 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-22 21:07:14,798 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:14,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:14,799 INFO L85 PathProgramCache]: Analyzing trace with hash 327722515, now seen corresponding path program 1 times [2024-11-22 21:07:14,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:14,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64211678] [2024-11-22 21:07:14,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:14,800 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-22 21:07:14,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:14,801 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-22 21:07:14,802 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-22 21:07:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:14,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:07:14,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:14,941 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-22 21:07:14,957 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-22 21:07:14,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:14,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:14,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64211678] [2024-11-22 21:07:14,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64211678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:14,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:14,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:07:14,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160390874] [2024-11-22 21:07:14,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:14,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:07:14,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:14,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:07:14,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:07:14,959 INFO L87 Difference]: Start difference. First operand 3702 states and 5126 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-22 21:07:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:18,361 INFO L93 Difference]: Finished difference Result 5507 states and 7586 transitions. [2024-11-22 21:07:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:07:18,361 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-22 21:07:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:18,376 INFO L225 Difference]: With dead ends: 5507 [2024-11-22 21:07:18,376 INFO L226 Difference]: Without dead ends: 5507 [2024-11-22 21:07:18,376 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-22 21:07:18,377 INFO L432 NwaCegarLoop]: 2765 mSDtfsCounter, 1423 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 3968 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:18,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 3968 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-22 21:07:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5507 states. [2024-11-22 21:07:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5507 to 4046. [2024-11-22 21:07:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4046 states, 2973 states have (on average 1.922637066935755) internal successors, (5716), 4021 states have internal predecessors, (5716), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4046 states to 4046 states and 5766 transitions. [2024-11-22 21:07:18,432 INFO L78 Accepts]: Start accepts. Automaton has 4046 states and 5766 transitions. Word has length 8 [2024-11-22 21:07:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:18,432 INFO L471 AbstractCegarLoop]: Abstraction has 4046 states and 5766 transitions. [2024-11-22 21:07:18,433 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-22 21:07:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4046 states and 5766 transitions. [2024-11-22 21:07:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 21:07:18,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:18,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:18,437 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-22 21:07:18,633 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-22 21:07:18,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:18,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash -582246585, now seen corresponding path program 1 times [2024-11-22 21:07:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:18,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100553804] [2024-11-22 21:07:18,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:18,635 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-22 21:07:18,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:18,637 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-22 21:07:18,638 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-22 21:07:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:18,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:07:18,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:18,789 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-22 21:07:18,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:18,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100553804] [2024-11-22 21:07:18,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100553804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:18,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:18,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:07:18,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198473339] [2024-11-22 21:07:18,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:18,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:07:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:18,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:07:18,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:07:18,791 INFO L87 Difference]: Start difference. First operand 4046 states and 5766 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-22 21:07:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:18,824 INFO L93 Difference]: Finished difference Result 3986 states and 5680 transitions. [2024-11-22 21:07:18,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:07:18,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-22 21:07:18,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:18,833 INFO L225 Difference]: With dead ends: 3986 [2024-11-22 21:07:18,833 INFO L226 Difference]: Without dead ends: 3986 [2024-11-22 21:07:18,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-22 21:07:18,834 INFO L432 NwaCegarLoop]: 2419 mSDtfsCounter, 71 mSDsluCounter, 2356 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4775 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-22 21:07:18,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4775 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:07:18,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2024-11-22 21:07:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3986. [2024-11-22 21:07:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3986 states, 2937 states have (on average 1.9169220292815798) internal successors, (5630), 3961 states have internal predecessors, (5630), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 5680 transitions. [2024-11-22 21:07:18,914 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 5680 transitions. Word has length 11 [2024-11-22 21:07:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:18,914 INFO L471 AbstractCegarLoop]: Abstraction has 3986 states and 5680 transitions. [2024-11-22 21:07:18,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-22 21:07:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 5680 transitions. [2024-11-22 21:07:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 21:07:18,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:18,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:18,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-22 21:07:19,115 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-22 21:07:19,116 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:19,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1193166111, now seen corresponding path program 1 times [2024-11-22 21:07:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:19,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340959737] [2024-11-22 21:07:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:19,117 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-22 21:07:19,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:19,118 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-22 21:07:19,120 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-22 21:07:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:19,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:07:19,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:19,343 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-22 21:07:19,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:19,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340959737] [2024-11-22 21:07:19,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340959737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:19,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:19,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:07:19,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848557564] [2024-11-22 21:07:19,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:19,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:19,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:19,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:19,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:19,346 INFO L87 Difference]: Start difference. First operand 3986 states and 5680 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-22 21:07:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:19,421 INFO L93 Difference]: Finished difference Result 3956 states and 5622 transitions. [2024-11-22 21:07:19,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:07:19,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-22 21:07:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:19,437 INFO L225 Difference]: With dead ends: 3956 [2024-11-22 21:07:19,437 INFO L226 Difference]: Without dead ends: 3956 [2024-11-22 21:07:19,437 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-22 21:07:19,438 INFO L432 NwaCegarLoop]: 2374 mSDtfsCounter, 48 mSDsluCounter, 4722 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7096 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-22 21:07:19,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 7096 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:07:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2024-11-22 21:07:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3956. [2024-11-22 21:07:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 2921 states have (on average 1.907565902088326) internal successors, (5572), 3931 states have internal predecessors, (5572), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 5622 transitions. [2024-11-22 21:07:19,482 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 5622 transitions. Word has length 13 [2024-11-22 21:07:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:19,483 INFO L471 AbstractCegarLoop]: Abstraction has 3956 states and 5622 transitions. [2024-11-22 21:07:19,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-22 21:07:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 5622 transitions. [2024-11-22 21:07:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 21:07:19,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:19,484 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-22 21:07:19,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 21:07:19,687 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-22 21:07:19,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:19,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:19,688 INFO L85 PathProgramCache]: Analyzing trace with hash -555227553, now seen corresponding path program 1 times [2024-11-22 21:07:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:19,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980656481] [2024-11-22 21:07:19,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:19,689 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-22 21:07:19,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:19,691 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-22 21:07:19,699 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-22 21:07:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:19,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:07:19,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:19,887 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-22 21:07:19,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:19,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980656481] [2024-11-22 21:07:19,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980656481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:19,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:19,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:07:19,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630841245] [2024-11-22 21:07:19,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:19,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:07:19,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:19,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:07:19,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:07:19,889 INFO L87 Difference]: Start difference. First operand 3956 states and 5622 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-22 21:07:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:19,923 INFO L93 Difference]: Finished difference Result 3824 states and 5364 transitions. [2024-11-22 21:07:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:07:19,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-22 21:07:19,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:19,933 INFO L225 Difference]: With dead ends: 3824 [2024-11-22 21:07:19,934 INFO L226 Difference]: Without dead ends: 3824 [2024-11-22 21:07:19,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-22 21:07:19,935 INFO L432 NwaCegarLoop]: 2341 mSDtfsCounter, 71 mSDsluCounter, 2278 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4619 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-22 21:07:19,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4619 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:07:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3824 states. [2024-11-22 21:07:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3824 to 3824. [2024-11-22 21:07:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 2813 states have (on average 1.8890863846427302) internal successors, (5314), 3799 states have internal predecessors, (5314), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 5364 transitions. [2024-11-22 21:07:19,982 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 5364 transitions. Word has length 20 [2024-11-22 21:07:19,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:19,983 INFO L471 AbstractCegarLoop]: Abstraction has 3824 states and 5364 transitions. [2024-11-22 21:07:19,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-22 21:07:19,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 5364 transitions. [2024-11-22 21:07:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 21:07:19,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:19,984 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-22 21:07:19,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-22 21:07:20,187 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-22 21:07:20,189 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:20,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:20,189 INFO L85 PathProgramCache]: Analyzing trace with hash -286362849, now seen corresponding path program 1 times [2024-11-22 21:07:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:20,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859967713] [2024-11-22 21:07:20,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:20,190 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-22 21:07:20,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:20,194 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-22 21:07:20,195 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-22 21:07:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:20,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:07:20,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:20,390 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-22 21:07:20,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:20,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:20,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859967713] [2024-11-22 21:07:20,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859967713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:20,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:20,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:07:20,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474270720] [2024-11-22 21:07:20,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:20,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:07:20,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:20,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:07:20,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:07:20,393 INFO L87 Difference]: Start difference. First operand 3824 states and 5364 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-22 21:07:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:20,437 INFO L93 Difference]: Finished difference Result 3764 states and 5278 transitions. [2024-11-22 21:07:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:07:20,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-22 21:07:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:20,447 INFO L225 Difference]: With dead ends: 3764 [2024-11-22 21:07:20,447 INFO L226 Difference]: Without dead ends: 3764 [2024-11-22 21:07:20,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-22 21:07:20,448 INFO L432 NwaCegarLoop]: 2298 mSDtfsCounter, 71 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4533 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-22 21:07:20,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4533 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:07:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2024-11-22 21:07:20,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2024-11-22 21:07:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 2777 states have (on average 1.882607129996399) internal successors, (5228), 3739 states have internal predecessors, (5228), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5278 transitions. [2024-11-22 21:07:20,486 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5278 transitions. Word has length 20 [2024-11-22 21:07:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:20,486 INFO L471 AbstractCegarLoop]: Abstraction has 3764 states and 5278 transitions. [2024-11-22 21:07:20,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-22 21:07:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5278 transitions. [2024-11-22 21:07:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 21:07:20,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:20,488 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] [2024-11-22 21:07:20,498 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-22 21:07:20,688 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-22 21:07:20,689 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:20,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:20,689 INFO L85 PathProgramCache]: Analyzing trace with hash -997708103, now seen corresponding path program 1 times [2024-11-22 21:07:20,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:20,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775448770] [2024-11-22 21:07:20,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:20,691 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-22 21:07:20,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:20,692 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-22 21:07:20,694 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-22 21:07:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:20,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:07:20,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:20,913 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-22 21:07:20,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:20,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:20,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775448770] [2024-11-22 21:07:20,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775448770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:20,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:20,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:07:20,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737288951] [2024-11-22 21:07:20,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:20,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:20,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:20,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:20,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:20,914 INFO L87 Difference]: Start difference. First operand 3764 states and 5278 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-22 21:07:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:20,977 INFO L93 Difference]: Finished difference Result 3702 states and 5104 transitions. [2024-11-22 21:07:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:07:20,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-22 21:07:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:20,983 INFO L225 Difference]: With dead ends: 3702 [2024-11-22 21:07:20,983 INFO L226 Difference]: Without dead ends: 3702 [2024-11-22 21:07:20,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-22 21:07:20,984 INFO L432 NwaCegarLoop]: 2253 mSDtfsCounter, 48 mSDsluCounter, 4480 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6733 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-22 21:07:20,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6733 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:07:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2024-11-22 21:07:21,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3702. [2024-11-22 21:07:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3702 states, 2729 states have (on average 1.851960425064126) internal successors, (5054), 3677 states have internal predecessors, (5054), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 5104 transitions. [2024-11-22 21:07:21,018 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 5104 transitions. Word has length 22 [2024-11-22 21:07:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:21,018 INFO L471 AbstractCegarLoop]: Abstraction has 3702 states and 5104 transitions. [2024-11-22 21:07:21,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-22 21:07:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 5104 transitions. [2024-11-22 21:07:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 21:07:21,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:21,020 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] [2024-11-22 21:07:21,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-22 21:07:21,220 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-22 21:07:21,221 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:21,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:21,221 INFO L85 PathProgramCache]: Analyzing trace with hash -316792903, now seen corresponding path program 1 times [2024-11-22 21:07:21,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:21,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201699543] [2024-11-22 21:07:21,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:21,222 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-22 21:07:21,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:21,224 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-22 21:07:21,225 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-22 21:07:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:21,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:07:21,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:21,414 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-22 21:07:21,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:21,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:21,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201699543] [2024-11-22 21:07:21,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201699543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:21,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:21,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:07:21,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371371294] [2024-11-22 21:07:21,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:21,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:21,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:21,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:21,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:21,416 INFO L87 Difference]: Start difference. First operand 3702 states and 5104 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-22 21:07:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:21,479 INFO L93 Difference]: Finished difference Result 3672 states and 5046 transitions. [2024-11-22 21:07:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:07:21,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-22 21:07:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:21,484 INFO L225 Difference]: With dead ends: 3672 [2024-11-22 21:07:21,484 INFO L226 Difference]: Without dead ends: 3672 [2024-11-22 21:07:21,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-22 21:07:21,485 INFO L432 NwaCegarLoop]: 2218 mSDtfsCounter, 48 mSDsluCounter, 4410 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6628 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-22 21:07:21,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6628 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:07:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2024-11-22 21:07:21,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3672. [2024-11-22 21:07:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3672 states, 2713 states have (on average 1.841503870254331) internal successors, (4996), 3647 states have internal predecessors, (4996), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 5046 transitions. [2024-11-22 21:07:21,513 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 5046 transitions. Word has length 22 [2024-11-22 21:07:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:21,513 INFO L471 AbstractCegarLoop]: Abstraction has 3672 states and 5046 transitions. [2024-11-22 21:07:21,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-22 21:07:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 5046 transitions. [2024-11-22 21:07:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 21:07:21,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:21,516 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] [2024-11-22 21:07:21,522 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-22 21:07:21,717 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-22 21:07:21,717 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:21,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:21,718 INFO L85 PathProgramCache]: Analyzing trace with hash -544433649, now seen corresponding path program 1 times [2024-11-22 21:07:21,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:21,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252103970] [2024-11-22 21:07:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:21,718 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-22 21:07:21,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:21,724 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-22 21:07:21,726 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-22 21:07:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:21,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:07:21,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:21,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 21:07:21,943 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-22 21:07:21,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:21,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:21,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252103970] [2024-11-22 21:07:21,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252103970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:21,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:21,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:07:21,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118313249] [2024-11-22 21:07:21,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:21,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:21,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:21,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:21,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:21,945 INFO L87 Difference]: Start difference. First operand 3672 states and 5046 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-22 21:07:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:24,891 INFO L93 Difference]: Finished difference Result 4290 states and 5579 transitions. [2024-11-22 21:07:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:07:24,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-22 21:07:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:24,898 INFO L225 Difference]: With dead ends: 4290 [2024-11-22 21:07:24,898 INFO L226 Difference]: Without dead ends: 4290 [2024-11-22 21:07:24,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-22 21:07:24,899 INFO L432 NwaCegarLoop]: 1525 mSDtfsCounter, 2013 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 3356 SdHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:24,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2023 Valid, 3356 Invalid, 2482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-22 21:07:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4290 states. [2024-11-22 21:07:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4290 to 3668. [2024-11-22 21:07:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 2713 states have (on average 1.8385551050497604) internal successors, (4988), 3643 states have internal predecessors, (4988), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 5038 transitions. [2024-11-22 21:07:24,933 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 5038 transitions. Word has length 27 [2024-11-22 21:07:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:24,933 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 5038 transitions. [2024-11-22 21:07:24,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-22 21:07:24,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 5038 transitions. [2024-11-22 21:07:24,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 21:07:24,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:24,934 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] [2024-11-22 21:07:24,941 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-22 21:07:25,139 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-22 21:07:25,140 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:25,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:25,140 INFO L85 PathProgramCache]: Analyzing trace with hash -544433648, now seen corresponding path program 1 times [2024-11-22 21:07:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:25,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903604441] [2024-11-22 21:07:25,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:25,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:07:25,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:25,143 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-22 21:07:25,150 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-22 21:07:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:25,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:07:25,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:25,317 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-22 21:07:25,415 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-22 21:07:25,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:25,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:25,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903604441] [2024-11-22 21:07:25,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903604441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:25,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:25,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:07:25,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920402053] [2024-11-22 21:07:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:25,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:25,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:25,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:25,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:25,417 INFO L87 Difference]: Start difference. First operand 3668 states and 5038 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-22 21:07:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:29,319 INFO L93 Difference]: Finished difference Result 4402 states and 5844 transitions. [2024-11-22 21:07:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:07:29,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-22 21:07:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:29,325 INFO L225 Difference]: With dead ends: 4402 [2024-11-22 21:07:29,325 INFO L226 Difference]: Without dead ends: 4402 [2024-11-22 21:07:29,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-22 21:07:29,326 INFO L432 NwaCegarLoop]: 1929 mSDtfsCounter, 806 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 4303 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:29,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 4303 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-22 21:07:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4402 states. [2024-11-22 21:07:29,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4402 to 3704. [2024-11-22 21:07:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3704 states, 2749 states have (on average 1.8293925063659513) internal successors, (5029), 3679 states have internal predecessors, (5029), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 5079 transitions. [2024-11-22 21:07:29,352 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 5079 transitions. Word has length 27 [2024-11-22 21:07:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:29,353 INFO L471 AbstractCegarLoop]: Abstraction has 3704 states and 5079 transitions. [2024-11-22 21:07:29,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-22 21:07:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 5079 transitions. [2024-11-22 21:07:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-22 21:07:29,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:29,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:29,358 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-22 21:07:29,554 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-22 21:07:29,554 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:29,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:29,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1953826599, now seen corresponding path program 1 times [2024-11-22 21:07:29,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:29,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080408583] [2024-11-22 21:07:29,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:29,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:07:29,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:29,557 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-22 21:07:29,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-22 21:07:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:29,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:07:29,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:29,756 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-22 21:07:29,806 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-22 21:07:29,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:29,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:29,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080408583] [2024-11-22 21:07:29,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080408583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:29,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:29,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:07:29,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12025035] [2024-11-22 21:07:29,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:29,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:29,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:29,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:29,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:29,808 INFO L87 Difference]: Start difference. First operand 3704 states and 5079 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-22 21:07:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:32,772 INFO L93 Difference]: Finished difference Result 4420 states and 5843 transitions. [2024-11-22 21:07:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:07:32,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-22 21:07:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:32,777 INFO L225 Difference]: With dead ends: 4420 [2024-11-22 21:07:32,777 INFO L226 Difference]: Without dead ends: 4420 [2024-11-22 21:07:32,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-22 21:07:32,777 INFO L432 NwaCegarLoop]: 2203 mSDtfsCounter, 1691 mSDsluCounter, 2370 mSDsCounter, 0 mSdLazyCounter, 2786 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:32,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 4573 Invalid, 2797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2786 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-22 21:07:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2024-11-22 21:07:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 3700. [2024-11-22 21:07:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 2749 states have (on average 1.8206620589305202) internal successors, (5005), 3675 states have internal predecessors, (5005), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 5055 transitions. [2024-11-22 21:07:32,840 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 5055 transitions. Word has length 36 [2024-11-22 21:07:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:32,840 INFO L471 AbstractCegarLoop]: Abstraction has 3700 states and 5055 transitions. [2024-11-22 21:07:32,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-22 21:07:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 5055 transitions. [2024-11-22 21:07:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-22 21:07:32,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:32,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:32,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-22 21:07:33,042 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-22 21:07:33,043 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:33,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1953826600, now seen corresponding path program 1 times [2024-11-22 21:07:33,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:33,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443427595] [2024-11-22 21:07:33,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:33,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:07:33,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:33,049 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-22 21:07:33,052 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-22 21:07:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:33,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:07:33,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:33,264 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-22 21:07:33,424 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-22 21:07:33,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:33,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:33,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443427595] [2024-11-22 21:07:33,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443427595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:33,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:33,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:07:33,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45899489] [2024-11-22 21:07:33,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:33,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:33,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:33,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:33,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:33,425 INFO L87 Difference]: Start difference. First operand 3700 states and 5055 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-22 21:07:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:37,438 INFO L93 Difference]: Finished difference Result 5029 states and 6723 transitions. [2024-11-22 21:07:37,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:07:37,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-22 21:07:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:37,445 INFO L225 Difference]: With dead ends: 5029 [2024-11-22 21:07:37,445 INFO L226 Difference]: Without dead ends: 5029 [2024-11-22 21:07:37,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-22 21:07:37,448 INFO L432 NwaCegarLoop]: 2555 mSDtfsCounter, 1190 mSDsluCounter, 2801 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 5356 SdHoareTripleChecker+Invalid, 2845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:37,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 5356 Invalid, 2845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-22 21:07:37,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2024-11-22 21:07:37,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 3700. [2024-11-22 21:07:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 2749 states have (on average 1.8177519097853765) internal successors, (4997), 3675 states have internal predecessors, (4997), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 5047 transitions. [2024-11-22 21:07:37,490 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 5047 transitions. Word has length 36 [2024-11-22 21:07:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:37,491 INFO L471 AbstractCegarLoop]: Abstraction has 3700 states and 5047 transitions. [2024-11-22 21:07:37,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-22 21:07:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 5047 transitions. [2024-11-22 21:07:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-22 21:07:37,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:37,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:37,498 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-22 21:07:37,695 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-22 21:07:37,696 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:37,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:37,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1978988007, now seen corresponding path program 1 times [2024-11-22 21:07:37,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:37,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502828] [2024-11-22 21:07:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:37,697 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-22 21:07:37,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:37,698 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-22 21:07:37,699 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-22 21:07:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:37,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:07:37,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:37,904 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-22 21:07:37,954 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-22 21:07:37,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:37,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:37,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502828] [2024-11-22 21:07:37,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:37,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:37,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:07:37,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500892214] [2024-11-22 21:07:37,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:37,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:37,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:37,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:37,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:37,956 INFO L87 Difference]: Start difference. First operand 3700 states and 5047 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-22 21:07:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:40,916 INFO L93 Difference]: Finished difference Result 4400 states and 5811 transitions. [2024-11-22 21:07:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:07:40,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-22 21:07:40,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:40,921 INFO L225 Difference]: With dead ends: 4400 [2024-11-22 21:07:40,921 INFO L226 Difference]: Without dead ends: 4400 [2024-11-22 21:07:40,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-22 21:07:40,922 INFO L432 NwaCegarLoop]: 2203 mSDtfsCounter, 1687 mSDsluCounter, 2370 mSDsCounter, 0 mSdLazyCounter, 2778 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:40,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 4573 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2778 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-22 21:07:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2024-11-22 21:07:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 3696. [2024-11-22 21:07:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 2749 states have (on average 1.8148417606402327) internal successors, (4989), 3671 states have internal predecessors, (4989), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5039 transitions. [2024-11-22 21:07:40,981 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 5039 transitions. Word has length 36 [2024-11-22 21:07:40,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:40,981 INFO L471 AbstractCegarLoop]: Abstraction has 3696 states and 5039 transitions. [2024-11-22 21:07:40,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-22 21:07:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 5039 transitions. [2024-11-22 21:07:40,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-22 21:07:40,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:40,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:40,989 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-22 21:07:41,182 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-22 21:07:41,182 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:41,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:41,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1978988008, now seen corresponding path program 1 times [2024-11-22 21:07:41,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:41,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739900519] [2024-11-22 21:07:41,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:41,183 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-22 21:07:41,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:41,184 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-22 21:07:41,186 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-22 21:07:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:41,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:07:41,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:41,419 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-22 21:07:41,595 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-22 21:07:41,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:41,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:41,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739900519] [2024-11-22 21:07:41,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739900519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:41,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:41,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:07:41,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722607354] [2024-11-22 21:07:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:41,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:41,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:41,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:41,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:41,597 INFO L87 Difference]: Start difference. First operand 3696 states and 5039 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-22 21:07:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:45,864 INFO L93 Difference]: Finished difference Result 5021 states and 6707 transitions. [2024-11-22 21:07:45,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:07:45,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-22 21:07:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:45,868 INFO L225 Difference]: With dead ends: 5021 [2024-11-22 21:07:45,868 INFO L226 Difference]: Without dead ends: 5021 [2024-11-22 21:07:45,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-22 21:07:45,868 INFO L432 NwaCegarLoop]: 2551 mSDtfsCounter, 1182 mSDsluCounter, 2767 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 5318 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:45,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 5318 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-22 21:07:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5021 states. [2024-11-22 21:07:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5021 to 3692. [2024-11-22 21:07:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 2749 states have (on average 1.8119316114950892) internal successors, (4981), 3667 states have internal predecessors, (4981), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 5031 transitions. [2024-11-22 21:07:45,928 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 5031 transitions. Word has length 36 [2024-11-22 21:07:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:45,932 INFO L471 AbstractCegarLoop]: Abstraction has 3692 states and 5031 transitions. [2024-11-22 21:07:45,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-22 21:07:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 5031 transitions. [2024-11-22 21:07:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-22 21:07:45,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:45,933 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] [2024-11-22 21:07:45,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-22 21:07:46,133 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-22 21:07:46,134 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:46,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:46,135 INFO L85 PathProgramCache]: Analyzing trace with hash 841114057, now seen corresponding path program 1 times [2024-11-22 21:07:46,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:46,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505328967] [2024-11-22 21:07:46,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:46,136 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-22 21:07:46,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:46,140 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-22 21:07:46,145 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-22 21:07:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:46,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:07:46,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:46,409 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-22 21:07:46,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:46,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:46,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505328967] [2024-11-22 21:07:46,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505328967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:46,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:46,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:07:46,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269036414] [2024-11-22 21:07:46,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:46,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:46,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:46,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:46,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:46,413 INFO L87 Difference]: Start difference. First operand 3692 states and 5031 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-22 21:07:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:46,484 INFO L93 Difference]: Finished difference Result 3680 states and 5007 transitions. [2024-11-22 21:07:46,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:07:46,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-11-22 21:07:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:46,491 INFO L225 Difference]: With dead ends: 3680 [2024-11-22 21:07:46,492 INFO L226 Difference]: Without dead ends: 3680 [2024-11-22 21:07:46,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-22 21:07:46,492 INFO L432 NwaCegarLoop]: 2204 mSDtfsCounter, 27 mSDsluCounter, 4371 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6575 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-22 21:07:46,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6575 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:07:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2024-11-22 21:07:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3680. [2024-11-22 21:07:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 2737 states have (on average 1.8111070515162586) internal successors, (4957), 3655 states have internal predecessors, (4957), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 21:07:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 5007 transitions. [2024-11-22 21:07:46,520 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 5007 transitions. Word has length 41 [2024-11-22 21:07:46,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:46,520 INFO L471 AbstractCegarLoop]: Abstraction has 3680 states and 5007 transitions. [2024-11-22 21:07:46,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-22 21:07:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 5007 transitions. [2024-11-22 21:07:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 21:07:46,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:46,521 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] [2024-11-22 21:07:46,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-22 21:07:46,722 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-22 21:07:46,722 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:46,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash 385316629, now seen corresponding path program 1 times [2024-11-22 21:07:46,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:46,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729083532] [2024-11-22 21:07:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:46,723 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-22 21:07:46,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:46,724 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-22 21:07:46,726 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-22 21:07:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:46,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:07:46,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:07:47,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:47,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:47,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729083532] [2024-11-22 21:07:47,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729083532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:47,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:47,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:07:47,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604662145] [2024-11-22 21:07:47,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:47,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:07:47,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:47,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:07:47,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:07:47,095 INFO L87 Difference]: Start difference. First operand 3680 states and 5007 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-22 21:07:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:47,285 INFO L93 Difference]: Finished difference Result 5511 states and 7253 transitions. [2024-11-22 21:07:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:07:47,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2024-11-22 21:07:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:47,291 INFO L225 Difference]: With dead ends: 5511 [2024-11-22 21:07:47,291 INFO L226 Difference]: Without dead ends: 5511 [2024-11-22 21:07:47,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-22 21:07:47,292 INFO L432 NwaCegarLoop]: 2289 mSDtfsCounter, 1487 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 4407 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:47,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 4407 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 21:07:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5511 states. [2024-11-22 21:07:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5511 to 4734. [2024-11-22 21:07:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4734 states, 3784 states have (on average 1.7957188160676534) internal successors, (6795), 4699 states have internal predecessors, (6795), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-22 21:07:47,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 6865 transitions. [2024-11-22 21:07:47,362 INFO L78 Accepts]: Start accepts. Automaton has 4734 states and 6865 transitions. Word has length 49 [2024-11-22 21:07:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:47,362 INFO L471 AbstractCegarLoop]: Abstraction has 4734 states and 6865 transitions. [2024-11-22 21:07:47,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-22 21:07:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 4734 states and 6865 transitions. [2024-11-22 21:07:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-22 21:07:47,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:47,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:47,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-22 21:07:47,563 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-22 21:07:47,564 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:47,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:47,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2050666657, now seen corresponding path program 1 times [2024-11-22 21:07:47,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:47,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932687125] [2024-11-22 21:07:47,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:47,569 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-22 21:07:47,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:47,570 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-22 21:07:47,573 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-22 21:07:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:47,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:07:47,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:47,826 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-22 21:07:47,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:47,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:47,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932687125] [2024-11-22 21:07:47,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932687125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:47,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:47,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:07:47,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021174070] [2024-11-22 21:07:47,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:47,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:47,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:47,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:47,829 INFO L87 Difference]: Start difference. First operand 4734 states and 6865 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:07:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:47,876 INFO L93 Difference]: Finished difference Result 4692 states and 6795 transitions. [2024-11-22 21:07:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:07:47,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-22 21:07:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:47,880 INFO L225 Difference]: With dead ends: 4692 [2024-11-22 21:07:47,888 INFO L226 Difference]: Without dead ends: 4692 [2024-11-22 21:07:47,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:07:47,889 INFO L432 NwaCegarLoop]: 2200 mSDtfsCounter, 27 mSDsluCounter, 4363 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6563 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-22 21:07:47,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6563 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:07:47,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2024-11-22 21:07:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 4692. [2024-11-22 21:07:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4692 states, 3742 states have (on average 1.7971672902191342) internal successors, (6725), 4657 states have internal predecessors, (6725), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-22 21:07:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4692 states to 4692 states and 6795 transitions. [2024-11-22 21:07:47,922 INFO L78 Accepts]: Start accepts. Automaton has 4692 states and 6795 transitions. Word has length 52 [2024-11-22 21:07:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:47,922 INFO L471 AbstractCegarLoop]: Abstraction has 4692 states and 6795 transitions. [2024-11-22 21:07:47,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:07:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4692 states and 6795 transitions. [2024-11-22 21:07:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-22 21:07:47,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:47,923 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] [2024-11-22 21:07:47,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-22 21:07:48,124 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-22 21:07:48,124 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:48,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:48,125 INFO L85 PathProgramCache]: Analyzing trace with hash 705263610, now seen corresponding path program 1 times [2024-11-22 21:07:48,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:48,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157547288] [2024-11-22 21:07:48,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:48,125 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-22 21:07:48,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:48,127 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-22 21:07:48,128 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-22 21:07:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:48,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:07:48,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:48,372 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-22 21:07:48,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:48,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:48,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157547288] [2024-11-22 21:07:48,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157547288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:48,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:48,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:07:48,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117019279] [2024-11-22 21:07:48,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:48,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:48,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:48,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:48,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:48,373 INFO L87 Difference]: Start difference. First operand 4692 states and 6795 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-22 21:07:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:48,422 INFO L93 Difference]: Finished difference Result 4674 states and 6765 transitions. [2024-11-22 21:07:48,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:07:48,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-11-22 21:07:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:48,427 INFO L225 Difference]: With dead ends: 4674 [2024-11-22 21:07:48,427 INFO L226 Difference]: Without dead ends: 4674 [2024-11-22 21:07:48,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-22 21:07:48,428 INFO L432 NwaCegarLoop]: 2196 mSDtfsCounter, 21 mSDsluCounter, 4361 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6557 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-22 21:07:48,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6557 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:07:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2024-11-22 21:07:48,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 4674. [2024-11-22 21:07:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4674 states, 3724 states have (on average 1.797798066595059) internal successors, (6695), 4639 states have internal predecessors, (6695), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-22 21:07:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 6765 transitions. [2024-11-22 21:07:48,461 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 6765 transitions. Word has length 55 [2024-11-22 21:07:48,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:48,461 INFO L471 AbstractCegarLoop]: Abstraction has 4674 states and 6765 transitions. [2024-11-22 21:07:48,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-22 21:07:48,461 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 6765 transitions. [2024-11-22 21:07:48,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-22 21:07:48,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:48,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:48,468 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-22 21:07:48,666 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-22 21:07:48,666 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:48,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1121817781, now seen corresponding path program 1 times [2024-11-22 21:07:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:48,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172161064] [2024-11-22 21:07:48,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:48,667 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-22 21:07:48,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:48,671 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-22 21:07:48,672 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-22 21:07:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:48,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:07:48,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:48,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 21:07:48,956 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 21:07:48,961 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-22 21:07:48,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:07:48,995 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-22 21:07:49,035 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-22 21:07:49,040 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:49,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:49,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172161064] [2024-11-22 21:07:49,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172161064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:49,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:49,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:07:49,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451385155] [2024-11-22 21:07:49,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:49,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:49,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:49,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:49,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:49,042 INFO L87 Difference]: Start difference. First operand 4674 states and 6765 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:07:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:49,763 INFO L93 Difference]: Finished difference Result 6132 states and 8780 transitions. [2024-11-22 21:07:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:07:49,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-22 21:07:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:49,775 INFO L225 Difference]: With dead ends: 6132 [2024-11-22 21:07:49,775 INFO L226 Difference]: Without dead ends: 6132 [2024-11-22 21:07:49,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:07:49,780 INFO L432 NwaCegarLoop]: 2318 mSDtfsCounter, 1694 mSDsluCounter, 3701 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 6019 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:49,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 6019 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 21:07:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2024-11-22 21:07:49,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 4640. [2024-11-22 21:07:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4640 states, 3690 states have (on average 1.8048780487804879) internal successors, (6660), 4605 states have internal predecessors, (6660), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-22 21:07:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4640 states to 4640 states and 6730 transitions. [2024-11-22 21:07:49,818 INFO L78 Accepts]: Start accepts. Automaton has 4640 states and 6730 transitions. Word has length 60 [2024-11-22 21:07:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:49,819 INFO L471 AbstractCegarLoop]: Abstraction has 4640 states and 6730 transitions. [2024-11-22 21:07:49,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:07:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4640 states and 6730 transitions. [2024-11-22 21:07:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-22 21:07:49,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:49,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:49,826 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-22 21:07:50,020 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-22 21:07:50,020 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:50,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:50,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1034209811, now seen corresponding path program 1 times [2024-11-22 21:07:50,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:50,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285245545] [2024-11-22 21:07:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:50,021 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-22 21:07:50,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:50,023 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-22 21:07:50,024 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-22 21:07:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:50,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:07:50,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:50,412 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-22 21:07:50,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:50,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:50,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285245545] [2024-11-22 21:07:50,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285245545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:50,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:50,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:07:50,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557511032] [2024-11-22 21:07:50,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:50,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:07:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:50,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:07:50,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:07:50,414 INFO L87 Difference]: Start difference. First operand 4640 states and 6730 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:07:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:50,527 INFO L93 Difference]: Finished difference Result 6468 states and 9033 transitions. [2024-11-22 21:07:50,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:07:50,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-22 21:07:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:50,533 INFO L225 Difference]: With dead ends: 6468 [2024-11-22 21:07:50,533 INFO L226 Difference]: Without dead ends: 6468 [2024-11-22 21:07:50,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:07:50,534 INFO L432 NwaCegarLoop]: 2294 mSDtfsCounter, 1197 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 4443 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:50,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 4443 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 21:07:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6468 states. [2024-11-22 21:07:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6468 to 5740. [2024-11-22 21:07:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5740 states, 4782 states have (on average 1.7806357172731075) internal successors, (8515), 5694 states have internal predecessors, (8515), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-22 21:07:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5740 states to 5740 states and 8607 transitions. [2024-11-22 21:07:50,597 INFO L78 Accepts]: Start accepts. Automaton has 5740 states and 8607 transitions. Word has length 60 [2024-11-22 21:07:50,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:50,598 INFO L471 AbstractCegarLoop]: Abstraction has 5740 states and 8607 transitions. [2024-11-22 21:07:50,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:07:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 5740 states and 8607 transitions. [2024-11-22 21:07:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 21:07:50,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:50,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:50,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-22 21:07:50,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:07:50,799 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:50,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:50,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1844344716, now seen corresponding path program 1 times [2024-11-22 21:07:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309608610] [2024-11-22 21:07:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:50,805 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-22 21:07:50,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:50,808 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:07:50,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-22 21:07:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:51,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:07:51,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:51,125 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 21:07:51,125 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 21:07:51,125 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 21:07:51,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-22 21:07:51,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:07:51,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-22 21:07:51,240 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-22 21:07:51,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:51,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:51,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309608610] [2024-11-22 21:07:51,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309608610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:51,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:51,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:07:51,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274838536] [2024-11-22 21:07:51,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:51,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:51,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:51,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:51,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:51,241 INFO L87 Difference]: Start difference. First operand 5740 states and 8607 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-22 21:07:51,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:51,639 INFO L93 Difference]: Finished difference Result 6064 states and 8693 transitions. [2024-11-22 21:07:51,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:07:51,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2024-11-22 21:07:51,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:51,646 INFO L225 Difference]: With dead ends: 6064 [2024-11-22 21:07:51,646 INFO L226 Difference]: Without dead ends: 6064 [2024-11-22 21:07:51,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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-22 21:07:51,646 INFO L432 NwaCegarLoop]: 2201 mSDtfsCounter, 857 mSDsluCounter, 4286 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 6487 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:51,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 6487 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 21:07:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6064 states. [2024-11-22 21:07:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6064 to 5299. [2024-11-22 21:07:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 4341 states have (on average 1.8007371573370192) internal successors, (7817), 5256 states have internal predecessors, (7817), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-22 21:07:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 7903 transitions. [2024-11-22 21:07:51,686 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 7903 transitions. Word has length 63 [2024-11-22 21:07:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:51,686 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 7903 transitions. [2024-11-22 21:07:51,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-22 21:07:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 7903 transitions. [2024-11-22 21:07:51,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 21:07:51,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:51,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:07:51,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-22 21:07:51,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:07:51,888 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:51,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:51,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1265725906, now seen corresponding path program 1 times [2024-11-22 21:07:51,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:51,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392782786] [2024-11-22 21:07:51,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:51,889 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-22 21:07:51,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:51,890 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:07:51,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-22 21:07:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:52,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 21:07:52,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:52,212 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-22 21:07:52,217 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-22 21:07:52,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:07:52,555 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-22 21:07:52,563 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 21:07:52,563 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-22 21:07:52,571 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-22 21:07:52,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:52,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:52,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392782786] [2024-11-22 21:07:52,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392782786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:52,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:52,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:07:52,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810035344] [2024-11-22 21:07:52,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:52,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:07:52,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:52,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:07:52,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:07:52,573 INFO L87 Difference]: Start difference. First operand 5299 states and 7903 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-22 21:07:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:55,141 INFO L93 Difference]: Finished difference Result 5215 states and 7660 transitions. [2024-11-22 21:07:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:07:55,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2024-11-22 21:07:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:55,147 INFO L225 Difference]: With dead ends: 5215 [2024-11-22 21:07:55,147 INFO L226 Difference]: Without dead ends: 5215 [2024-11-22 21:07:55,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 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-22 21:07:55,151 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 3212 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3222 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:55,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3222 Valid, 1284 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-22 21:07:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5215 states. [2024-11-22 21:07:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5215 to 5075. [2024-11-22 21:07:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5075 states, 4201 states have (on average 1.741966198524161) internal successors, (7318), 5032 states have internal predecessors, (7318), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-22 21:07:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 7404 transitions. [2024-11-22 21:07:55,198 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 7404 transitions. Word has length 63 [2024-11-22 21:07:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:55,198 INFO L471 AbstractCegarLoop]: Abstraction has 5075 states and 7404 transitions. [2024-11-22 21:07:55,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-22 21:07:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 7404 transitions. [2024-11-22 21:07:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-22 21:07:55,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:55,199 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] [2024-11-22 21:07:55,210 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 (26)] Ended with exit code 0 [2024-11-22 21:07:55,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:07:55,404 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:55,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:55,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1551615488, now seen corresponding path program 1 times [2024-11-22 21:07:55,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:55,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231060231] [2024-11-22 21:07:55,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:55,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:07:55,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:55,406 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:07:55,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-22 21:07:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:55,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:07:55,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:55,706 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-22 21:07:55,721 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-22 21:07:55,740 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-22 21:07:55,747 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-22 21:07:55,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:55,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:55,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231060231] [2024-11-22 21:07:55,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231060231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:55,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:55,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:07:55,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290196744] [2024-11-22 21:07:55,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:55,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:07:55,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:55,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:07:55,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:07:55,748 INFO L87 Difference]: Start difference. First operand 5075 states and 7404 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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-22 21:07:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:07:58,427 INFO L93 Difference]: Finished difference Result 5074 states and 7401 transitions. [2024-11-22 21:07:58,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:07:58,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-11-22 21:07:58,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:07:58,433 INFO L225 Difference]: With dead ends: 5074 [2024-11-22 21:07:58,433 INFO L226 Difference]: Without dead ends: 5074 [2024-11-22 21:07:58,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 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-22 21:07:58,433 INFO L432 NwaCegarLoop]: 2123 mSDtfsCounter, 2 mSDsluCounter, 3533 mSDsCounter, 0 mSdLazyCounter, 2843 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5656 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-22 21:07:58,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5656 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2843 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-22 21:07:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2024-11-22 21:07:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 5074. [2024-11-22 21:07:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5074 states, 4201 states have (on average 1.7412520828374196) internal successors, (7315), 5031 states have internal predecessors, (7315), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-22 21:07:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5074 states to 5074 states and 7401 transitions. [2024-11-22 21:07:58,491 INFO L78 Accepts]: Start accepts. Automaton has 5074 states and 7401 transitions. Word has length 68 [2024-11-22 21:07:58,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:07:58,491 INFO L471 AbstractCegarLoop]: Abstraction has 5074 states and 7401 transitions. [2024-11-22 21:07:58,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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-22 21:07:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 5074 states and 7401 transitions. [2024-11-22 21:07:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-22 21:07:58,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:07:58,493 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] [2024-11-22 21:07:58,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-22 21:07:58,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:07:58,697 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:07:58,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:07:58,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1551615487, now seen corresponding path program 1 times [2024-11-22 21:07:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:07:58,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452613196] [2024-11-22 21:07:58,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:07:58,698 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-22 21:07:58,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:07:58,700 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:07:58,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-22 21:07:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:07:58,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 21:07:58,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:07:58,967 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-22 21:07:58,980 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-22 21:07:58,986 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-22 21:07:59,015 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-22 21:07:59,026 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-22 21:07:59,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:07:59,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:07:59,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452613196] [2024-11-22 21:07:59,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452613196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:07:59,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:07:59,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:07:59,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460572599] [2024-11-22 21:07:59,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:07:59,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:07:59,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:07:59,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:07:59,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:07:59,027 INFO L87 Difference]: Start difference. First operand 5074 states and 7401 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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-22 21:08:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:08:03,142 INFO L93 Difference]: Finished difference Result 5073 states and 7398 transitions. [2024-11-22 21:08:03,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:08:03,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-11-22 21:08:03,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:08:03,147 INFO L225 Difference]: With dead ends: 5073 [2024-11-22 21:08:03,148 INFO L226 Difference]: Without dead ends: 5073 [2024-11-22 21:08:03,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 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-22 21:08:03,148 INFO L432 NwaCegarLoop]: 2123 mSDtfsCounter, 1 mSDsluCounter, 3511 mSDsCounter, 0 mSdLazyCounter, 2862 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:08:03,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5634 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2862 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-22 21:08:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5073 states. [2024-11-22 21:08:03,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5073 to 5073. [2024-11-22 21:08:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5073 states, 4198 states have (on average 1.7417818008575512) internal successors, (7312), 5030 states have internal predecessors, (7312), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-22 21:08:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5073 states to 5073 states and 7398 transitions. [2024-11-22 21:08:03,181 INFO L78 Accepts]: Start accepts. Automaton has 5073 states and 7398 transitions. Word has length 68 [2024-11-22 21:08:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:08:03,182 INFO L471 AbstractCegarLoop]: Abstraction has 5073 states and 7398 transitions. [2024-11-22 21:08:03,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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-22 21:08:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 5073 states and 7398 transitions. [2024-11-22 21:08:03,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-22 21:08:03,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:08:03,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:08:03,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-11-22 21:08:03,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:08:03,384 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:08:03,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:08:03,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1215350439, now seen corresponding path program 1 times [2024-11-22 21:08:03,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:08:03,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956535135] [2024-11-22 21:08:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:08:03,385 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-22 21:08:03,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:08:03,387 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:08:03,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-22 21:08:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:08:03,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:08:03,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:08:03,683 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-22 21:08:03,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:08:03,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:08:03,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956535135] [2024-11-22 21:08:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956535135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:08:03,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:08:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:08:03,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024105987] [2024-11-22 21:08:03,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:08:03,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:08:03,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:08:03,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:08:03,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:08:03,685 INFO L87 Difference]: Start difference. First operand 5073 states and 7398 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-22 21:08:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:08:03,738 INFO L93 Difference]: Finished difference Result 5076 states and 7406 transitions. [2024-11-22 21:08:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:08:03,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 76 [2024-11-22 21:08:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:08:03,752 INFO L225 Difference]: With dead ends: 5076 [2024-11-22 21:08:03,753 INFO L226 Difference]: Without dead ends: 5076 [2024-11-22 21:08:03,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 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-22 21:08:03,756 INFO L432 NwaCegarLoop]: 2122 mSDtfsCounter, 0 mSDsluCounter, 4236 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6358 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:08:03,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6358 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:08:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5076 states. [2024-11-22 21:08:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5076 to 5076. [2024-11-22 21:08:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5076 states, 4200 states have (on average 1.7416666666666667) internal successors, (7315), 5033 states have internal predecessors, (7315), 43 states have call successors, (43), 3 states have call predecessors, (43), 4 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-22 21:08:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7406 transitions. [2024-11-22 21:08:03,840 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7406 transitions. Word has length 76 [2024-11-22 21:08:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:08:03,840 INFO L471 AbstractCegarLoop]: Abstraction has 5076 states and 7406 transitions. [2024-11-22 21:08:03,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-22 21:08:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7406 transitions. [2024-11-22 21:08:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-22 21:08:03,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:08:03,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:08:03,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-22 21:08:04,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:08:04,042 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:08:04,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:08:04,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2074467548, now seen corresponding path program 1 times [2024-11-22 21:08:04,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:08:04,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389907562] [2024-11-22 21:08:04,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:08:04,044 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-22 21:08:04,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:08:04,047 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:08:04,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-22 21:08:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:08:04,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:08:04,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:08:04,346 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-22 21:08:04,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:08:04,391 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-22 21:08:04,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:08:04,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389907562] [2024-11-22 21:08:04,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389907562] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:08:04,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:08:04,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 21:08:04,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283793416] [2024-11-22 21:08:04,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:08:04,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 21:08:04,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:08:04,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 21:08:04,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 21:08:04,393 INFO L87 Difference]: Start difference. First operand 5076 states and 7406 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 21:08:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:08:04,528 INFO L93 Difference]: Finished difference Result 5088 states and 7427 transitions. [2024-11-22 21:08:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:08:04,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2024-11-22 21:08:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:08:04,537 INFO L225 Difference]: With dead ends: 5088 [2024-11-22 21:08:04,537 INFO L226 Difference]: Without dead ends: 5088 [2024-11-22 21:08:04,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 146 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-22 21:08:04,538 INFO L432 NwaCegarLoop]: 2121 mSDtfsCounter, 8 mSDsluCounter, 8465 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10586 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:08:04,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10586 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 21:08:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5088 states. [2024-11-22 21:08:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5088 to 5086. [2024-11-22 21:08:04,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5086 states, 4209 states have (on average 1.7415062960323118) internal successors, (7330), 5042 states have internal predecessors, (7330), 43 states have call successors, (43), 4 states have call predecessors, (43), 5 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-22 21:08:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5086 states to 5086 states and 7421 transitions. [2024-11-22 21:08:04,581 INFO L78 Accepts]: Start accepts. Automaton has 5086 states and 7421 transitions. Word has length 77 [2024-11-22 21:08:04,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:08:04,581 INFO L471 AbstractCegarLoop]: Abstraction has 5086 states and 7421 transitions. [2024-11-22 21:08:04,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 21:08:04,581 INFO L276 IsEmpty]: Start isEmpty. Operand 5086 states and 7421 transitions. [2024-11-22 21:08:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-22 21:08:04,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:08:04,582 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:08:04,590 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 (30)] Ended with exit code 0 [2024-11-22 21:08:04,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-22 21:08:04,783 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:08:04,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:08:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1507688985, now seen corresponding path program 2 times [2024-11-22 21:08:04,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:08:04,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414124704] [2024-11-22 21:08:04,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:08:04,784 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-22 21:08:04,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:08:04,785 INFO L229 MonitoredProcess]: Starting monitored process 31 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-22 21:08:04,786 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 (31)] Waiting until timeout for monitored process [2024-11-22 21:08:05,270 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:08:05,271 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:08:05,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 21:08:05,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:08:05,320 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-22 21:08:05,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:08:05,426 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-22 21:08:05,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:08:05,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414124704] [2024-11-22 21:08:05,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414124704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:08:05,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:08:05,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-22 21:08:05,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394535942] [2024-11-22 21:08:05,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:08:05,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 21:08:05,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:08:05,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 21:08:05,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-22 21:08:05,428 INFO L87 Difference]: Start difference. First operand 5086 states and 7421 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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-22 21:08:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:08:05,828 INFO L93 Difference]: Finished difference Result 5101 states and 7447 transitions. [2024-11-22 21:08:05,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 21:08:05,829 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2024-11-22 21:08:05,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:08:05,836 INFO L225 Difference]: With dead ends: 5101 [2024-11-22 21:08:05,836 INFO L226 Difference]: Without dead ends: 5097 [2024-11-22 21:08:05,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 146 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-22 21:08:05,837 INFO L432 NwaCegarLoop]: 2121 mSDtfsCounter, 14 mSDsluCounter, 12700 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 14821 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:08:05,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 14821 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 21:08:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2024-11-22 21:08:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 5095. [2024-11-22 21:08:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 4218 states have (on average 1.7406353722143195) internal successors, (7342), 5051 states have internal predecessors, (7342), 43 states have call successors, (43), 4 states have call predecessors, (43), 5 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-22 21:08:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 7433 transitions. [2024-11-22 21:08:05,879 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 7433 transitions. Word has length 80 [2024-11-22 21:08:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:08:05,879 INFO L471 AbstractCegarLoop]: Abstraction has 5095 states and 7433 transitions. [2024-11-22 21:08:05,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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-22 21:08:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 7433 transitions. [2024-11-22 21:08:05,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 21:08:05,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:08:05,880 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:08:05,890 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 (31)] Ended with exit code 0 [2024-11-22 21:08:06,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-22 21:08:06,081 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:08:06,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:08:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash -526875449, now seen corresponding path program 3 times [2024-11-22 21:08:06,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:08:06,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327613496] [2024-11-22 21:08:06,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:08:06,083 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-22 21:08:06,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:08:06,085 INFO L229 MonitoredProcess]: Starting monitored process 32 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-22 21:08:06,086 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 (32)] Waiting until timeout for monitored process [2024-11-22 21:08:06,767 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-22 21:08:06,768 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:08:06,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 21:08:06,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:08:06,887 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-22 21:08:06,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:08:07,282 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-22 21:08:07,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:08:07,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327613496] [2024-11-22 21:08:07,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327613496] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:08:07,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:08:07,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-22 21:08:07,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004568021] [2024-11-22 21:08:07,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:08:07,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 21:08:07,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:08:07,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 21:08:07,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-22 21:08:07,284 INFO L87 Difference]: Start difference. First operand 5095 states and 7433 transitions. Second operand has 26 states, 26 states have (on average 3.730769230769231) internal successors, (97), 26 states have internal predecessors, (97), 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-22 21:08:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:08:08,646 INFO L93 Difference]: Finished difference Result 5119 states and 7472 transitions. [2024-11-22 21:08:08,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-22 21:08:08,647 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.730769230769231) internal successors, (97), 26 states have internal predecessors, (97), 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 86 [2024-11-22 21:08:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:08:08,654 INFO L225 Difference]: With dead ends: 5119 [2024-11-22 21:08:08,655 INFO L226 Difference]: Without dead ends: 5113 [2024-11-22 21:08:08,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 146 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-22 21:08:08,656 INFO L432 NwaCegarLoop]: 2122 mSDtfsCounter, 26 mSDsluCounter, 25412 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27534 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 21:08:08,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27534 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 21:08:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5113 states. [2024-11-22 21:08:08,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5113 to 5113. [2024-11-22 21:08:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5113 states, 4236 states have (on average 1.7386685552407932) internal successors, (7365), 5069 states have internal predecessors, (7365), 43 states have call successors, (43), 4 states have call predecessors, (43), 5 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-22 21:08:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5113 states to 5113 states and 7456 transitions. [2024-11-22 21:08:08,697 INFO L78 Accepts]: Start accepts. Automaton has 5113 states and 7456 transitions. Word has length 86 [2024-11-22 21:08:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:08:08,698 INFO L471 AbstractCegarLoop]: Abstraction has 5113 states and 7456 transitions. [2024-11-22 21:08:08,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.730769230769231) internal successors, (97), 26 states have internal predecessors, (97), 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-22 21:08:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5113 states and 7456 transitions. [2024-11-22 21:08:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 21:08:08,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:08:08,698 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:08:08,708 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 (32)] Forceful destruction successful, exit code 0 [2024-11-22 21:08:08,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-22 21:08:08,900 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:08:08,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:08:08,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1750558073, now seen corresponding path program 4 times [2024-11-22 21:08:08,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:08:08,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309840250] [2024-11-22 21:08:08,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:08:08,901 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-22 21:08:08,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:08:08,903 INFO L229 MonitoredProcess]: Starting monitored process 33 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-22 21:08:08,904 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 (33)] Waiting until timeout for monitored process [2024-11-22 21:08:09,418 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:08:09,418 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:08:09,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 21:08:09,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:08:09,755 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-22 21:08:09,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:08:10,853 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-22 21:08:10,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:08:10,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309840250] [2024-11-22 21:08:10,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309840250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:08:10,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:08:10,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-22 21:08:10,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059136197] [2024-11-22 21:08:10,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:08:10,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-22 21:08:10,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:08:10,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-22 21:08:10,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 21:08:10,860 INFO L87 Difference]: Start difference. First operand 5113 states and 7456 transitions. Second operand has 50 states, 50 states have (on average 2.42) internal successors, (121), 50 states have internal predecessors, (121), 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-22 21:08:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:08:15,410 INFO L93 Difference]: Finished difference Result 5153 states and 7532 transitions. [2024-11-22 21:08:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-22 21:08:15,411 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.42) internal successors, (121), 50 states have internal predecessors, (121), 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 98 [2024-11-22 21:08:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:08:15,417 INFO L225 Difference]: With dead ends: 5153 [2024-11-22 21:08:15,418 INFO L226 Difference]: Without dead ends: 5149 [2024-11-22 21:08:15,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-22 21:08:15,420 INFO L432 NwaCegarLoop]: 2121 mSDtfsCounter, 49 mSDsluCounter, 48695 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 50816 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 21:08:15,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 50816 Invalid, 2148 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [119 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 21:08:15,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5149 states. [2024-11-22 21:08:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5149 to 5147. [2024-11-22 21:08:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5147 states, 4270 states have (on average 1.7355971896955504) internal successors, (7411), 5103 states have internal predecessors, (7411), 43 states have call successors, (43), 4 states have call predecessors, (43), 5 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-22 21:08:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 7502 transitions. [2024-11-22 21:08:15,455 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 7502 transitions. Word has length 98 [2024-11-22 21:08:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:08:15,456 INFO L471 AbstractCegarLoop]: Abstraction has 5147 states and 7502 transitions. [2024-11-22 21:08:15,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.42) internal successors, (121), 50 states have internal predecessors, (121), 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-22 21:08:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 7502 transitions. [2024-11-22 21:08:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-22 21:08:15,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:08:15,457 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:08:15,468 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 (33)] Ended with exit code 0 [2024-11-22 21:08:15,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-22 21:08:15,661 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-22 21:08:15,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:08:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1616266855, now seen corresponding path program 5 times [2024-11-22 21:08:15,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:08:15,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556578760] [2024-11-22 21:08:15,662 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 21:08:15,662 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-22 21:08:15,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:08:15,663 INFO L229 MonitoredProcess]: Starting monitored process 34 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-22 21:08:15,665 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 (34)] Waiting until timeout for monitored process [2024-11-22 21:08:16,874 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-22 21:08:16,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:08:16,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-22 21:08:16,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:08:16,908 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-22 21:08:16,996 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-22 21:08:16,996 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-22 21:08:17,017 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-22 21:08:17,083 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-22 21:08:17,815 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:08:17,816 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-22 21:08:17,838 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-22 21:08:17,861 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-22 21:08:17,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:08:18,125 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2589 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_2589) |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-22 21:08:18,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:08:18,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556578760] [2024-11-22 21:08:18,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556578760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:08:18,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [875282641] [2024-11-22 21:08:18,127 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 21:08:18,127 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 21:08:18,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 21:08:18,129 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 21:08:18,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process