./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:33:17,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:33:17,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:33:17,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:33:17,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:33:17,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:33:17,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:33:17,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:33:17,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:33:17,222 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:33:17,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:33:17,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:33:17,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:33:17,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:33:17,223 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:33:17,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:33:17,224 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:33:17,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:33:17,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:33:17,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:33:17,225 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:33:17,225 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:33:17,225 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:33:17,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:33:17,226 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:33:17,226 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:33:17,226 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:33:17,226 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:33:17,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:33:17,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:33:17,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:33:17,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:33:17,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:33:17,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:33:17,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:33:17,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:33:17,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:33:17,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:33:17,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:33:17,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:33:17,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:33:17,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:33:17,229 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-10 17:33:17,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:33:17,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:33:17,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:33:17,442 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:33:17,442 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:33:17,443 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_nondet_test1-2.i [2024-11-10 17:33:18,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:33:18,908 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:33:18,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2024-11-10 17:33:18,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc74d266/4d01e8c7c647492d8b3c35d1e5e1cee9/FLAGd0c6c0c07 [2024-11-10 17:33:19,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc74d266/4d01e8c7c647492d8b3c35d1e5e1cee9 [2024-11-10 17:33:19,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:33:19,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:33:19,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:33:19,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:33:19,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:33:19,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:33:19" (1/1) ... [2024-11-10 17:33:19,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e09fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:19, skipping insertion in model container [2024-11-10 17:33:19,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:33:19" (1/1) ... [2024-11-10 17:33:19,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:33:19,617 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:19,650 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:19,655 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:19,658 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:19,666 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:19,683 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:19,684 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:19,688 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:19,689 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:19,691 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:19,692 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:19,695 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:19,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:33:19,715 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-10 17:33:19,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@627061b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:19, skipping insertion in model container [2024-11-10 17:33:19,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:33:19,716 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 17:33:19,718 INFO L158 Benchmark]: Toolchain (without parser) took 443.27ms. Allocated memory is still 184.5MB. Free memory was 124.9MB in the beginning and 104.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 17:33:19,718 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory was 146.9MB in the beginning and 146.7MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:33:19,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.61ms. Allocated memory is still 184.5MB. Free memory was 124.4MB in the beginning and 104.3MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 17:33:19,720 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.15ms. Allocated memory is still 184.5MB. Free memory was 146.9MB in the beginning and 146.7MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.61ms. Allocated memory is still 184.5MB. Free memory was 124.4MB in the beginning and 104.3MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 753]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:33:21,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:33:21,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:33:21,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:33:21,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:33:21,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:33:21,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:33:21,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:33:21,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:33:21,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:33:21,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:33:21,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:33:21,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:33:21,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:33:21,378 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:33:21,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:33:21,378 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:33:21,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:33:21,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:33:21,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:33:21,379 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:33:21,380 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:33:21,380 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:33:21,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:33:21,380 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:33:21,381 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:33:21,381 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:33:21,381 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:33:21,381 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:33:21,382 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:33:21,382 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:33:21,382 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:33:21,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:33:21,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:33:21,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:33:21,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:33:21,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:33:21,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:33:21,384 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:33:21,384 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:33:21,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:33:21,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:33:21,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:33:21,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:33:21,385 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-10 17:33:21,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:33:21,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:33:21,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:33:21,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:33:21,662 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:33:21,663 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_nondet_test1-2.i [2024-11-10 17:33:22,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:33:23,131 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:33:23,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2024-11-10 17:33:23,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4308a222/6dfab576fd394361b30d40a9371737b2/FLAGbc6942a13 [2024-11-10 17:33:23,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4308a222/6dfab576fd394361b30d40a9371737b2 [2024-11-10 17:33:23,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:33:23,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:33:23,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:33:23,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:33:23,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:33:23,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62735693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23, skipping insertion in model container [2024-11-10 17:33:23,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:33:23,511 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,541 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,548 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,553 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,561 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,573 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,574 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,577 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,579 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,579 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,580 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,582 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:33:23,602 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 17:33:23,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:33:23,622 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,638 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,640 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,642 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,647 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,659 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,661 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,662 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,663 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,665 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,666 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,668 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:23,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:33:23,675 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:33:23,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:33:23,785 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:33:23,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23 WrapperNode [2024-11-10 17:33:23,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:33:23,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:33:23,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:33:23,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:33:23,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,851 INFO L138 Inliner]: procedures = 179, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 739 [2024-11-10 17:33:23,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:33:23,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:33:23,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:33:23,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:33:23,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,920 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-11-10 17:33:23,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,950 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:33:23,970 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:33:23,971 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:33:23,971 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:33:23,971 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23" (1/1) ... [2024-11-10 17:33:23,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:33:23,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:33:24,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:33:24,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:33:24,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 17:33:24,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 17:33:24,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 17:33:24,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 17:33:24,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:33:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:33:24,040 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:33:24,040 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:33:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:33:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:33:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:33:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:33:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:33:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:33:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:33:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 17:33:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 17:33:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:33:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 17:33:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:33:24,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:33:24,201 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:33:24,203 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:33:26,029 INFO L? ?]: Removed 893 outVars from TransFormulas that were not future-live. [2024-11-10 17:33:26,030 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:33:26,064 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:33:26,064 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:33:26,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:33:26 BoogieIcfgContainer [2024-11-10 17:33:26,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:33:26,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:33:26,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:33:26,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:33:26,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:33:23" (1/3) ... [2024-11-10 17:33:26,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5637f254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:33:26, skipping insertion in model container [2024-11-10 17:33:26,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:23" (2/3) ... [2024-11-10 17:33:26,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5637f254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:33:26, skipping insertion in model container [2024-11-10 17:33:26,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:33:26" (3/3) ... [2024-11-10 17:33:26,074 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test1-2.i [2024-11-10 17:33:26,085 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:33:26,086 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 425 error locations. [2024-11-10 17:33:26,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:33:26,141 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;@6e25d7bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:33:26,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2024-11-10 17:33:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 857 states, 430 states have (on average 2.1744186046511627) internal successors, (935), 852 states have internal predecessors, (935), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:33:26,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:26,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:33:26,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr423REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:26,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:26,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1251501955, now seen corresponding path program 1 times [2024-11-10 17:33:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:26,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558801146] [2024-11-10 17:33:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:26,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:26,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:26,166 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:26,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 17:33:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:26,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 17:33:26,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:26,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:26,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:26,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558801146] [2024-11-10 17:33:26,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558801146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:26,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:26,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:33:26,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929740579] [2024-11-10 17:33:26,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:26,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 17:33:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:26,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 17:33:26,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:33:26,319 INFO L87 Difference]: Start difference. First operand has 857 states, 430 states have (on average 2.1744186046511627) internal successors, (935), 852 states have internal predecessors, (935), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:26,373 INFO L93 Difference]: Finished difference Result 846 states and 884 transitions. [2024-11-10 17:33:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 17:33:26,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:33:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:26,396 INFO L225 Difference]: With dead ends: 846 [2024-11-10 17:33:26,396 INFO L226 Difference]: Without dead ends: 843 [2024-11-10 17:33:26,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:33:26,400 INFO L432 NwaCegarLoop]: 884 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:26,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:33:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-10 17:33:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2024-11-10 17:33:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 422 states have (on average 2.0734597156398102) internal successors, (875), 838 states have internal predecessors, (875), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 881 transitions. [2024-11-10 17:33:26,488 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 881 transitions. Word has length 6 [2024-11-10 17:33:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:26,488 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 881 transitions. [2024-11-10 17:33:26,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 881 transitions. [2024-11-10 17:33:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:33:26,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:26,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:33:26,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 17:33:26,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:26,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr423REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:26,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1251501924, now seen corresponding path program 1 times [2024-11-10 17:33:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:26,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049733686] [2024-11-10 17:33:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:26,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:26,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:26,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:26,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 17:33:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:26,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:33:26,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:26,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:33:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:26,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:26,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:26,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049733686] [2024-11-10 17:33:26,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049733686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:26,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:26,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:33:26,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684152448] [2024-11-10 17:33:26,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:26,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:33:26,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:26,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:33:26,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:26,804 INFO L87 Difference]: Start difference. First operand 843 states and 881 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:27,713 INFO L93 Difference]: Finished difference Result 797 states and 836 transitions. [2024-11-10 17:33:27,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:33:27,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:33:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:27,716 INFO L225 Difference]: With dead ends: 797 [2024-11-10 17:33:27,716 INFO L226 Difference]: Without dead ends: 797 [2024-11-10 17:33:27,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:27,717 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 526 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:27,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 644 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 17:33:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-10 17:33:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 794. [2024-11-10 17:33:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 422 states have (on average 1.957345971563981) internal successors, (826), 789 states have internal predecessors, (826), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 832 transitions. [2024-11-10 17:33:27,729 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 832 transitions. Word has length 6 [2024-11-10 17:33:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:27,729 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 832 transitions. [2024-11-10 17:33:27,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 832 transitions. [2024-11-10 17:33:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:33:27,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:27,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:33:27,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 17:33:27,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:27,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr424REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:27,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1251501923, now seen corresponding path program 1 times [2024-11-10 17:33:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:27,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141824883] [2024-11-10 17:33:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:27,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:27,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:27,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:27,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 17:33:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:28,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:33:28,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:28,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:33:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:28,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:28,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141824883] [2024-11-10 17:33:28,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141824883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:28,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:28,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:33:28,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268653544] [2024-11-10 17:33:28,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:28,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:33:28,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:28,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:33:28,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:28,039 INFO L87 Difference]: Start difference. First operand 794 states and 832 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:28,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:28,930 INFO L93 Difference]: Finished difference Result 871 states and 913 transitions. [2024-11-10 17:33:28,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:33:28,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:33:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:28,933 INFO L225 Difference]: With dead ends: 871 [2024-11-10 17:33:28,933 INFO L226 Difference]: Without dead ends: 871 [2024-11-10 17:33:28,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:28,934 INFO L432 NwaCegarLoop]: 703 mSDtfsCounter, 273 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:28,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 999 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 17:33:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-10 17:33:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 822. [2024-11-10 17:33:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 461 states have (on average 1.9327548806941433) internal successors, (891), 817 states have internal predecessors, (891), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 897 transitions. [2024-11-10 17:33:28,945 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 897 transitions. Word has length 6 [2024-11-10 17:33:28,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:28,945 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 897 transitions. [2024-11-10 17:33:28,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:28,945 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 897 transitions. [2024-11-10 17:33:28,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 17:33:28,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:28,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:28,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:29,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:29,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:29,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash -125039944, now seen corresponding path program 1 times [2024-11-10 17:33:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:29,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538366908] [2024-11-10 17:33:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:29,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:29,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:29,151 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:29,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 17:33:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:29,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:33:29,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:29,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:29,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:29,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538366908] [2024-11-10 17:33:29,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538366908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:29,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:29,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:33:29,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466420438] [2024-11-10 17:33:29,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:29,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:33:29,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:33:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:29,218 INFO L87 Difference]: Start difference. First operand 822 states and 897 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:29,250 INFO L93 Difference]: Finished difference Result 1411 states and 1549 transitions. [2024-11-10 17:33:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:33:29,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 17:33:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:29,255 INFO L225 Difference]: With dead ends: 1411 [2024-11-10 17:33:29,255 INFO L226 Difference]: Without dead ends: 1411 [2024-11-10 17:33:29,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:29,257 INFO L432 NwaCegarLoop]: 818 mSDtfsCounter, 568 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:29,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1634 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:33:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2024-11-10 17:33:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 824. [2024-11-10 17:33:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 463 states have (on average 1.9287257019438444) internal successors, (893), 819 states have internal predecessors, (893), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 899 transitions. [2024-11-10 17:33:29,280 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 899 transitions. Word has length 8 [2024-11-10 17:33:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:29,281 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 899 transitions. [2024-11-10 17:33:29,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 899 transitions. [2024-11-10 17:33:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 17:33:29,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:29,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:29,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 17:33:29,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:29,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:29,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1016028384, now seen corresponding path program 1 times [2024-11-10 17:33:29,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:29,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477782752] [2024-11-10 17:33:29,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:29,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:29,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:29,485 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:29,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 17:33:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:29,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:33:29,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:29,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:29,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:29,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477782752] [2024-11-10 17:33:29,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477782752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:29,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:29,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:33:29,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113113438] [2024-11-10 17:33:29,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:29,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:33:29,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:29,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:33:29,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:29,591 INFO L87 Difference]: Start difference. First operand 824 states and 899 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:29,610 INFO L93 Difference]: Finished difference Result 782 states and 856 transitions. [2024-11-10 17:33:29,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:33:29,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-10 17:33:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:29,615 INFO L225 Difference]: With dead ends: 782 [2024-11-10 17:33:29,615 INFO L226 Difference]: Without dead ends: 782 [2024-11-10 17:33:29,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:29,617 INFO L432 NwaCegarLoop]: 766 mSDtfsCounter, 71 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:29,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1468 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:33:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-10 17:33:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2024-11-10 17:33:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 445 states have (on average 1.9101123595505618) internal successors, (850), 777 states have internal predecessors, (850), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 856 transitions. [2024-11-10 17:33:29,628 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 856 transitions. Word has length 17 [2024-11-10 17:33:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:29,628 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 856 transitions. [2024-11-10 17:33:29,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 856 transitions. [2024-11-10 17:33:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 17:33:29,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:29,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:29,637 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 (6)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:29,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:29,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr393REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:29,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1445745197, now seen corresponding path program 1 times [2024-11-10 17:33:29,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:29,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370061902] [2024-11-10 17:33:29,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:29,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:29,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:29,834 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:29,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 17:33:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:29,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:33:29,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:29,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:29,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:29,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370061902] [2024-11-10 17:33:29,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370061902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:29,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:29,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:33:29,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574040387] [2024-11-10 17:33:29,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:29,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:33:29,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:29,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:33:29,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:33:29,939 INFO L87 Difference]: Start difference. First operand 782 states and 856 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:29,991 INFO L93 Difference]: Finished difference Result 760 states and 827 transitions. [2024-11-10 17:33:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:33:29,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 17:33:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:29,993 INFO L225 Difference]: With dead ends: 760 [2024-11-10 17:33:29,993 INFO L226 Difference]: Without dead ends: 760 [2024-11-10 17:33:29,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:33:29,994 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 48 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:29,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2136 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:33:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-10 17:33:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2024-11-10 17:33:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 437 states have (on average 1.8787185354691076) internal successors, (821), 755 states have internal predecessors, (821), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 827 transitions. [2024-11-10 17:33:30,004 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 827 transitions. Word has length 19 [2024-11-10 17:33:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:30,005 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 827 transitions. [2024-11-10 17:33:30,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 827 transitions. [2024-11-10 17:33:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 17:33:30,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:30,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:30,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:30,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:30,209 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr380REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:30,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:30,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1930808586, now seen corresponding path program 1 times [2024-11-10 17:33:30,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:30,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631547073] [2024-11-10 17:33:30,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:30,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:30,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:30,211 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:30,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 17:33:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:30,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:33:30,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:30,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:33:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:30,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:30,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:30,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631547073] [2024-11-10 17:33:30,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631547073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:30,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:30,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:33:30,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41556177] [2024-11-10 17:33:30,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:30,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:33:30,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:30,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:33:30,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:33:30,451 INFO L87 Difference]: Start difference. First operand 760 states and 827 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:31,666 INFO L93 Difference]: Finished difference Result 809 states and 843 transitions. [2024-11-10 17:33:31,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:33:31,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-10 17:33:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:31,671 INFO L225 Difference]: With dead ends: 809 [2024-11-10 17:33:31,671 INFO L226 Difference]: Without dead ends: 809 [2024-11-10 17:33:31,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:33:31,672 INFO L432 NwaCegarLoop]: 657 mSDtfsCounter, 206 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:31,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1298 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:33:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-10 17:33:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 756. [2024-11-10 17:33:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 437 states have (on average 1.8695652173913044) internal successors, (817), 751 states have internal predecessors, (817), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 823 transitions. [2024-11-10 17:33:31,682 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 823 transitions. Word has length 33 [2024-11-10 17:33:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:31,682 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 823 transitions. [2024-11-10 17:33:31,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 823 transitions. [2024-11-10 17:33:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 17:33:31,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:31,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:31,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 17:33:31,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:31,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr379REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:31,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:31,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1930808585, now seen corresponding path program 1 times [2024-11-10 17:33:31,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:31,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840307903] [2024-11-10 17:33:31,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:31,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:31,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:31,886 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:31,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 17:33:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:31,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:33:31,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:31,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:33:32,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-10 17:33:32,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:32,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:32,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840307903] [2024-11-10 17:33:32,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840307903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:32,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:32,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:33:32,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380079809] [2024-11-10 17:33:32,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:32,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:33:32,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:32,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:33:32,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:33:32,027 INFO L87 Difference]: Start difference. First operand 756 states and 823 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:33,013 INFO L93 Difference]: Finished difference Result 756 states and 823 transitions. [2024-11-10 17:33:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:33:33,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-10 17:33:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:33,015 INFO L225 Difference]: With dead ends: 756 [2024-11-10 17:33:33,015 INFO L226 Difference]: Without dead ends: 756 [2024-11-10 17:33:33,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:33:33,016 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 455 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:33,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 922 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:33:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-11-10 17:33:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 752. [2024-11-10 17:33:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 437 states have (on average 1.860411899313501) internal successors, (813), 747 states have internal predecessors, (813), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 819 transitions. [2024-11-10 17:33:33,027 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 819 transitions. Word has length 33 [2024-11-10 17:33:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:33,027 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 819 transitions. [2024-11-10 17:33:33,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 819 transitions. [2024-11-10 17:33:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 17:33:33,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:33,030 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] [2024-11-10 17:33:33,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 17:33:33,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:33,231 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr366REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:33,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1570747191, now seen corresponding path program 1 times [2024-11-10 17:33:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:33,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772798716] [2024-11-10 17:33:33,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:33,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:33,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:33,234 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:33,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 17:33:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:33,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:33:33,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:33,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:33,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772798716] [2024-11-10 17:33:33,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772798716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:33,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:33,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:33:33,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767645826] [2024-11-10 17:33:33,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:33,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:33:33,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:33,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:33:33,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:33:33,384 INFO L87 Difference]: Start difference. First operand 752 states and 819 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:33,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:33,431 INFO L93 Difference]: Finished difference Result 746 states and 809 transitions. [2024-11-10 17:33:33,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:33:33,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-10 17:33:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:33,434 INFO L225 Difference]: With dead ends: 746 [2024-11-10 17:33:33,434 INFO L226 Difference]: Without dead ends: 746 [2024-11-10 17:33:33,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:33:33,435 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 21 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:33,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2113 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:33:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-11-10 17:33:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2024-11-10 17:33:33,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 431 states have (on average 1.863109048723898) internal successors, (803), 741 states have internal predecessors, (803), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 809 transitions. [2024-11-10 17:33:33,445 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 809 transitions. Word has length 50 [2024-11-10 17:33:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:33,445 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 809 transitions. [2024-11-10 17:33:33,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 809 transitions. [2024-11-10 17:33:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 17:33:33,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:33,447 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] [2024-11-10 17:33:33,455 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-10 17:33:33,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:33,648 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr366REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:33,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash 197261935, now seen corresponding path program 1 times [2024-11-10 17:33:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:33,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078164309] [2024-11-10 17:33:33,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:33,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:33,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:33,651 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:33,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 17:33:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:33,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:33:33,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:33,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:33,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:33,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078164309] [2024-11-10 17:33:33,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078164309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:33,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:33,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:33:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904882493] [2024-11-10 17:33:33,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:33,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:33:33,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:33,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:33:33,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:33,981 INFO L87 Difference]: Start difference. First operand 746 states and 809 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:34,099 INFO L93 Difference]: Finished difference Result 976 states and 1068 transitions. [2024-11-10 17:33:34,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:33:34,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-10 17:33:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:34,102 INFO L225 Difference]: With dead ends: 976 [2024-11-10 17:33:34,102 INFO L226 Difference]: Without dead ends: 976 [2024-11-10 17:33:34,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:34,103 INFO L432 NwaCegarLoop]: 804 mSDtfsCounter, 184 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:34,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1468 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:33:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-10 17:33:34,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 799. [2024-11-10 17:33:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 484 states have (on average 1.7685950413223142) internal successors, (856), 794 states have internal predecessors, (856), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 862 transitions. [2024-11-10 17:33:34,113 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 862 transitions. Word has length 58 [2024-11-10 17:33:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:34,117 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 862 transitions. [2024-11-10 17:33:34,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 862 transitions. [2024-11-10 17:33:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 17:33:34,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:34,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:34,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:34,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:34,318 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr336REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:34,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1113372300, now seen corresponding path program 1 times [2024-11-10 17:33:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:34,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050432858] [2024-11-10 17:33:34,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:34,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:34,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:34,322 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:34,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 17:33:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:34,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:33:34,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:34,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:33:34,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:33:34,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:33:34,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 17:33:34,928 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:33:34,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 17:33:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:34,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:34,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:34,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050432858] [2024-11-10 17:33:34,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050432858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:34,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:34,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:33:34,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544456935] [2024-11-10 17:33:34,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:34,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:33:34,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:34,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:33:34,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:33:34,941 INFO L87 Difference]: Start difference. First operand 799 states and 862 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:35,835 INFO L93 Difference]: Finished difference Result 761 states and 824 transitions. [2024-11-10 17:33:35,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:33:35,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-10 17:33:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:35,838 INFO L225 Difference]: With dead ends: 761 [2024-11-10 17:33:35,838 INFO L226 Difference]: Without dead ends: 761 [2024-11-10 17:33:35,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:33:35,838 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 382 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:35,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 588 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 17:33:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-10 17:33:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 722. [2024-11-10 17:33:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 445 states have (on average 1.6674157303370787) internal successors, (742), 717 states have internal predecessors, (742), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 748 transitions. [2024-11-10 17:33:35,846 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 748 transitions. Word has length 61 [2024-11-10 17:33:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:35,847 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 748 transitions. [2024-11-10 17:33:35,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:35,847 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 748 transitions. [2024-11-10 17:33:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 17:33:35,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:35,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:35,859 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 (12)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:36,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:36,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr329REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:36,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:36,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2097353721, now seen corresponding path program 1 times [2024-11-10 17:33:36,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:36,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270804497] [2024-11-10 17:33:36,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:36,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:36,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:36,051 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:36,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-10 17:33:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:36,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:33:36,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:36,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:33:36,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:33:36,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 17:33:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:36,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:36,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:36,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270804497] [2024-11-10 17:33:36,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270804497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:36,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:36,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:33:36,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989240117] [2024-11-10 17:33:36,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:36,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:33:36,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:36,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:33:36,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:33:36,236 INFO L87 Difference]: Start difference. First operand 722 states and 748 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:37,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:37,251 INFO L93 Difference]: Finished difference Result 721 states and 747 transitions. [2024-11-10 17:33:37,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:33:37,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-10 17:33:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:37,256 INFO L225 Difference]: With dead ends: 721 [2024-11-10 17:33:37,257 INFO L226 Difference]: Without dead ends: 721 [2024-11-10 17:33:37,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:33:37,257 INFO L432 NwaCegarLoop]: 688 mSDtfsCounter, 2 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:37,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1740 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:33:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-10 17:33:37,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2024-11-10 17:33:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 445 states have (on average 1.6651685393258426) internal successors, (741), 716 states have internal predecessors, (741), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 747 transitions. [2024-11-10 17:33:37,266 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 747 transitions. Word has length 66 [2024-11-10 17:33:37,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:37,266 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 747 transitions. [2024-11-10 17:33:37,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 747 transitions. [2024-11-10 17:33:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 17:33:37,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:37,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:37,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:37,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:37,467 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:37,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2097353722, now seen corresponding path program 1 times [2024-11-10 17:33:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:37,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242187591] [2024-11-10 17:33:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:37,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:37,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:37,469 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:37,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-10 17:33:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:37,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 17:33:37,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:37,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:33:37,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:33:37,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:33:37,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-10 17:33:37,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:37,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:37,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:37,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242187591] [2024-11-10 17:33:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242187591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:37,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:37,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:33:37,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765254560] [2024-11-10 17:33:37,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:37,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:33:37,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:37,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:33:37,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:33:37,702 INFO L87 Difference]: Start difference. First operand 721 states and 747 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:38,948 INFO L93 Difference]: Finished difference Result 720 states and 746 transitions. [2024-11-10 17:33:38,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:33:38,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-10 17:33:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:38,950 INFO L225 Difference]: With dead ends: 720 [2024-11-10 17:33:38,950 INFO L226 Difference]: Without dead ends: 720 [2024-11-10 17:33:38,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:33:38,951 INFO L432 NwaCegarLoop]: 688 mSDtfsCounter, 1 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:38,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1776 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:33:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-10 17:33:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2024-11-10 17:33:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 444 states have (on average 1.6666666666666667) internal successors, (740), 715 states have internal predecessors, (740), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 746 transitions. [2024-11-10 17:33:38,960 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 746 transitions. Word has length 66 [2024-11-10 17:33:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:38,960 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 746 transitions. [2024-11-10 17:33:38,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 746 transitions. [2024-11-10 17:33:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 17:33:38,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:38,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:38,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-10 17:33:39,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:39,162 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr325REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:39,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:39,162 INFO L85 PathProgramCache]: Analyzing trace with hash -260564330, now seen corresponding path program 1 times [2024-11-10 17:33:39,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:39,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477878780] [2024-11-10 17:33:39,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:39,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:39,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:39,164 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:39,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-10 17:33:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:39,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:33:39,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:39,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:39,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:39,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477878780] [2024-11-10 17:33:39,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477878780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:39,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:39,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:33:39,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227810347] [2024-11-10 17:33:39,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:39,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:33:39,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:39,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:33:39,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:33:39,341 INFO L87 Difference]: Start difference. First operand 720 states and 746 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:33:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:39,366 INFO L93 Difference]: Finished difference Result 723 states and 750 transitions. [2024-11-10 17:33:39,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:33:39,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2024-11-10 17:33:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:39,369 INFO L225 Difference]: With dead ends: 723 [2024-11-10 17:33:39,369 INFO L226 Difference]: Without dead ends: 723 [2024-11-10 17:33:39,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:33:39,370 INFO L432 NwaCegarLoop]: 688 mSDtfsCounter, 0 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:39,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2059 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:33:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-10 17:33:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2024-11-10 17:33:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 446 states have (on average 1.6659192825112108) internal successors, (743), 718 states have internal predecessors, (743), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:33:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 750 transitions. [2024-11-10 17:33:39,380 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 750 transitions. Word has length 74 [2024-11-10 17:33:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:39,380 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 750 transitions. [2024-11-10 17:33:39,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:33:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 750 transitions. [2024-11-10 17:33:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 17:33:39,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:39,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:39,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-10 17:33:39,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:39,582 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr325REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:39,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1328014188, now seen corresponding path program 1 times [2024-11-10 17:33:39,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:39,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482779535] [2024-11-10 17:33:39,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:39,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:39,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:39,584 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:39,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-10 17:33:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:39,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:33:39,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:39,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:33:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:39,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:39,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482779535] [2024-11-10 17:33:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482779535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:33:39,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:33:39,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 17:33:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234396748] [2024-11-10 17:33:39,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:33:39,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 17:33:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:39,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 17:33:39,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:33:39,794 INFO L87 Difference]: Start difference. First operand 723 states and 750 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:33:39,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:39,871 INFO L93 Difference]: Finished difference Result 735 states and 767 transitions. [2024-11-10 17:33:39,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:33:39,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-10 17:33:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:39,874 INFO L225 Difference]: With dead ends: 735 [2024-11-10 17:33:39,874 INFO L226 Difference]: Without dead ends: 735 [2024-11-10 17:33:39,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-10 17:33:39,875 INFO L432 NwaCegarLoop]: 688 mSDtfsCounter, 8 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:39,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2061 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:33:39,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-10 17:33:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 733. [2024-11-10 17:33:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 455 states have (on average 1.665934065934066) internal successors, (758), 727 states have internal predecessors, (758), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:33:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 765 transitions. [2024-11-10 17:33:39,888 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 765 transitions. Word has length 75 [2024-11-10 17:33:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:39,888 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 765 transitions. [2024-11-10 17:33:39,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:33:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 765 transitions. [2024-11-10 17:33:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 17:33:39,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:39,890 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:39,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-10 17:33:40,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:40,095 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr325REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:40,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:40,095 INFO L85 PathProgramCache]: Analyzing trace with hash 157788694, now seen corresponding path program 2 times [2024-11-10 17:33:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:40,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096824283] [2024-11-10 17:33:40,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:33:40,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:40,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:40,098 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:40,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-10 17:33:40,371 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 17:33:40,372 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:33:40,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:33:40,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:40,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:33:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:40,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:40,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096824283] [2024-11-10 17:33:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096824283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:33:40,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:33:40,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 17:33:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139177929] [2024-11-10 17:33:40,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:33:40,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:33:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:40,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:33:40,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:33:40,528 INFO L87 Difference]: Start difference. First operand 733 states and 765 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:33:40,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:40,814 INFO L93 Difference]: Finished difference Result 748 states and 787 transitions. [2024-11-10 17:33:40,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 17:33:40,815 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-10 17:33:40,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:40,817 INFO L225 Difference]: With dead ends: 748 [2024-11-10 17:33:40,817 INFO L226 Difference]: Without dead ends: 744 [2024-11-10 17:33:40,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 17:33:40,818 INFO L432 NwaCegarLoop]: 688 mSDtfsCounter, 10 mSDsluCounter, 3428 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4116 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:40,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4116 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:33:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2024-11-10 17:33:40,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 742. [2024-11-10 17:33:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 464 states have (on average 1.6594827586206897) internal successors, (770), 736 states have internal predecessors, (770), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:33:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 777 transitions. [2024-11-10 17:33:40,828 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 777 transitions. Word has length 78 [2024-11-10 17:33:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:40,828 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 777 transitions. [2024-11-10 17:33:40,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:33:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 777 transitions. [2024-11-10 17:33:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-10 17:33:40,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:40,829 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:40,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:41,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:41,030 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr325REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:41,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:41,034 INFO L85 PathProgramCache]: Analyzing trace with hash 262666582, now seen corresponding path program 3 times [2024-11-10 17:33:41,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:41,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386058911] [2024-11-10 17:33:41,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:33:41,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:41,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:41,037 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:41,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-10 17:33:41,436 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 17:33:41,436 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:33:41,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 17:33:41,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:41,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:33:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:41,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:41,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386058911] [2024-11-10 17:33:41,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386058911] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:33:41,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:33:41,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 17:33:41,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712018569] [2024-11-10 17:33:41,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:33:41,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:33:41,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:41,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:33:41,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 17:33:41,982 INFO L87 Difference]: Start difference. First operand 742 states and 777 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:33:43,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:43,104 INFO L93 Difference]: Finished difference Result 766 states and 816 transitions. [2024-11-10 17:33:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 17:33:43,105 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 84 [2024-11-10 17:33:43,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:43,108 INFO L225 Difference]: With dead ends: 766 [2024-11-10 17:33:43,108 INFO L226 Difference]: Without dead ends: 760 [2024-11-10 17:33:43,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 17:33:43,109 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 24 mSDsluCounter, 7547 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 8236 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:43,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 8236 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 17:33:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-10 17:33:43,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2024-11-10 17:33:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 482 states have (on average 1.6452282157676348) internal successors, (793), 754 states have internal predecessors, (793), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:33:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 800 transitions. [2024-11-10 17:33:43,117 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 800 transitions. Word has length 84 [2024-11-10 17:33:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:43,117 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 800 transitions. [2024-11-10 17:33:43,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:33:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 800 transitions. [2024-11-10 17:33:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 17:33:43,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:43,118 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:43,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-10 17:33:43,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:43,318 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr325REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:43,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:43,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1640187862, now seen corresponding path program 4 times [2024-11-10 17:33:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:43,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773516342] [2024-11-10 17:33:43,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:33:43,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:43,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:43,320 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:43,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-10 17:33:43,598 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:33:43,598 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:33:43,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 17:33:43,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:43,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:33:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:33:44,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773516342] [2024-11-10 17:33:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773516342] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:33:44,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:33:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 17:33:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815931083] [2024-11-10 17:33:44,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:33:44,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 17:33:44,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:44,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 17:33:44,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 17:33:44,791 INFO L87 Difference]: Start difference. First operand 760 states and 800 transitions. Second operand has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:33:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:48,449 INFO L93 Difference]: Finished difference Result 800 states and 872 transitions. [2024-11-10 17:33:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 17:33:48,449 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-10 17:33:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:48,451 INFO L225 Difference]: With dead ends: 800 [2024-11-10 17:33:48,451 INFO L226 Difference]: Without dead ends: 796 [2024-11-10 17:33:48,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 17:33:48,453 INFO L432 NwaCegarLoop]: 688 mSDtfsCounter, 36 mSDsluCounter, 15758 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 16446 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:48,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 16446 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:33:48,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-11-10 17:33:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 794. [2024-11-10 17:33:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 516 states have (on average 1.625968992248062) internal successors, (839), 788 states have internal predecessors, (839), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:33:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 846 transitions. [2024-11-10 17:33:48,461 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 846 transitions. Word has length 96 [2024-11-10 17:33:48,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:48,461 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 846 transitions. [2024-11-10 17:33:48,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:33:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 846 transitions. [2024-11-10 17:33:48,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 17:33:48,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:48,462 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:48,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-10 17:33:48,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:48,667 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr325REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-10 17:33:48,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1025836310, now seen corresponding path program 5 times [2024-11-10 17:33:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:48,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112255268] [2024-11-10 17:33:48,668 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:33:48,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:48,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:48,669 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:48,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-10 17:33:49,629 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-10 17:33:49,630 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:33:49,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-10 17:33:49,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:49,670 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-10 17:33:49,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-10 17:33:49,955 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-10 17:33:49,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-10 17:33:50,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:33:50,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2024-11-10 17:33:51,858 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:33:51,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-11-10 17:33:51,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-11-10 17:33:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 17:33:51,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:33:52,204 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1650 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1650) |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-10 17:33:52,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:52,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112255268] [2024-11-10 17:33:52,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112255268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:33:52,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1196822241] [2024-11-10 17:33:52,206 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:33:52,206 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 17:33:52,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 17:33:52,208 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 17:33:52,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-10 17:34:53,260 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-10 17:34:53,261 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:34:53,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-10 17:34:53,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:53,473 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 17:34:53,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-10 17:34:53,669 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-10 17:34:53,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-10 17:34:53,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:34:53,826 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 34 treesize of output 16 [2024-11-10 17:34:54,617 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:34:54,618 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 54 treesize of output 51 [2024-11-10 17:34:54,674 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 43 treesize of output 19 [2024-11-10 17:34:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 17:34:54,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:34:54,914 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2096 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2096) |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-10 17:34:54,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1196822241] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:34:54,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:34:54,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-11-10 17:34:54,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392066762] [2024-11-10 17:34:54,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:34:54,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 17:34:54,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:54,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 17:34:54,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=321, Unknown=2, NotChecked=74, Total=462 [2024-11-10 17:34:54,916 INFO L87 Difference]: Start difference. First operand 794 states and 846 transitions. Second operand has 18 states, 15 states have (on average 9.866666666666667) internal successors, (148), 17 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)