./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:20:34,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:20:34,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:20:34,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:20:34,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:20:34,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:20:34,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:20:34,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:20:34,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:20:34,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:20:34,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:20:34,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:20:34,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:20:34,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:20:34,548 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:20:34,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:20:34,549 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:20:34,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:20:34,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:20:34,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:20:34,549 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:20:34,550 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:20:34,550 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:20:34,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:20:34,550 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:20:34,550 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:20:34,551 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:20:34,551 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:20:34,551 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:20:34,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:20:34,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:20:34,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:20:34,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:20:34,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:20:34,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:20:34,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:20:34,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:20:34,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:20:34,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:20:34,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:20:34,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:20:34,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:20:34,555 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-clean/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-clean/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 -> 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 [2024-10-11 19:20:34,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:20:34,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:20:34,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:20:34,780 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:20:34,781 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:20:34,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2024-10-11 19:20:36,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:20:36,398 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:20:36,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2024-10-11 19:20:36,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9aa1b3771/e1e6171b835d4eeda7962b292d30fe3b/FLAG4b179a30d [2024-10-11 19:20:36,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9aa1b3771/e1e6171b835d4eeda7962b292d30fe3b [2024-10-11 19:20:36,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:20:36,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:20:36,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:20:36,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:20:36,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:20:36,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:20:36" (1/1) ... [2024-10-11 19:20:36,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739d7876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:36, skipping insertion in model container [2024-10-11 19:20:36,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:20:36" (1/1) ... [2024-10-11 19:20:36,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:20:37,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:20:37,166 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-10-11 19:20:37,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7607c59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:37, skipping insertion in model container [2024-10-11 19:20:37,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:20:37,167 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:20:37,168 INFO L158 Benchmark]: Toolchain (without parser) took 707.93ms. Allocated memory is still 169.9MB. Free memory was 98.9MB in the beginning and 117.7MB in the end (delta: -18.8MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-10-11 19:20:37,169 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:20:37,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.33ms. Allocated memory is still 169.9MB. Free memory was 98.7MB in the beginning and 117.7MB in the end (delta: -18.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-10-11 19:20:37,171 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 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 706.33ms. Allocated memory is still 169.9MB. Free memory was 98.7MB in the beginning and 117.7MB in the end (delta: -18.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:20:38,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:20:39,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:20:39,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:20:39,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:20:39,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:20:39,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:20:39,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:20:39,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:20:39,093 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:20:39,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:20:39,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:20:39,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:20:39,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:20:39,095 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:20:39,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:20:39,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:20:39,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:20:39,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:20:39,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:20:39,097 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:20:39,098 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:20:39,098 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:20:39,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:20:39,098 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:20:39,098 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:20:39,101 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:20:39,102 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:20:39,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:20:39,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:20:39,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:20:39,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:20:39,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:20:39,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:20:39,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:20:39,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:20:39,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:20:39,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:20:39,103 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:20:39,103 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:20:39,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:20:39,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:20:39,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:20:39,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:20:39,104 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:20:39,105 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-clean/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-clean/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 -> 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 [2024-10-11 19:20:39,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:20:39,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:20:39,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:20:39,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:20:39,437 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:20:39,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2024-10-11 19:20:40,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:20:41,173 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:20:41,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2024-10-11 19:20:41,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6180bd0f6/7e6447c7907842588e757cdb94efece0/FLAG6782e6395 [2024-10-11 19:20:41,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6180bd0f6/7e6447c7907842588e757cdb94efece0 [2024-10-11 19:20:41,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:20:41,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:20:41,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:20:41,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:20:41,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:20:41,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:20:41" (1/1) ... [2024-10-11 19:20:41,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71623544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:41, skipping insertion in model container [2024-10-11 19:20:41,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:20:41" (1/1) ... [2024-10-11 19:20:41,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:20:41,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:20:41,916 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:20:41,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:20:42,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:20:42,054 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:20:42,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:20:42,196 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:20:42,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42 WrapperNode [2024-10-11 19:20:42,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:20:42,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:20:42,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:20:42,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:20:42,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42" (1/1) ... [2024-10-11 19:20:42,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42" (1/1) ... [2024-10-11 19:20:42,331 INFO L138 Inliner]: procedures = 180, calls = 558, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2439 [2024-10-11 19:20:42,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:20:42,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:20:42,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:20:42,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:20:42,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42" (1/1) ... [2024-10-11 19:20:42,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42" (1/1) ... [2024-10-11 19:20:42,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42" (1/1) ... [2024-10-11 19:20:42,489 INFO L175 MemorySlicer]: Split 528 memory accesses to 3 slices as follows [2, 106, 420]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 94 writes are split as follows [0, 4, 90]. [2024-10-11 19:20:42,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42" (1/1) ... [2024-10-11 19:20:42,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42" (1/1) ... [2024-10-11 19:20:42,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42" (1/1) ... [2024-10-11 19:20:42,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42" (1/1) ... [2024-10-11 19:20:42,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42" (1/1) ... [2024-10-11 19:20:42,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42" (1/1) ... [2024-10-11 19:20:42,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:20:42,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:20:42,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:20:42,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:20:42,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42" (1/1) ... [2024-10-11 19:20:42,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:20:42,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:20:42,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:20:42,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:20:42,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:20:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:20:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 19:20:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-11 19:20:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-11 19:20:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:20:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:20:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:20:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:20:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:20:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:20:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:20:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 19:20:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:20:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:20:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 19:20:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:20:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:20:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:20:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:20:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:20:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:20:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:20:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:20:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:20:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:20:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:20:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:20:42,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:20:42,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:20:42,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:20:42,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:20:42,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:20:42,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:20:42,901 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:20:42,903 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:20:42,959 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:20:42,988 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:20:43,002 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:20:48,803 INFO L? ?]: Removed 2232 outVars from TransFormulas that were not future-live. [2024-10-11 19:20:48,804 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:20:48,968 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:20:48,968 INFO L314 CfgBuilder]: Removed 160 assume(true) statements. [2024-10-11 19:20:48,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:20:48 BoogieIcfgContainer [2024-10-11 19:20:48,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:20:48,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:20:48,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:20:48,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:20:48,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:20:41" (1/3) ... [2024-10-11 19:20:48,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b3dc57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:20:48, skipping insertion in model container [2024-10-11 19:20:48,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:42" (2/3) ... [2024-10-11 19:20:48,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b3dc57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:20:48, skipping insertion in model container [2024-10-11 19:20:48,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:20:48" (3/3) ... [2024-10-11 19:20:48,975 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-2.i [2024-10-11 19:20:48,992 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:20:48,992 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1091 error locations. [2024-10-11 19:20:49,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:20:49,080 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;@3e73db05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:20:49,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1091 error locations. [2024-10-11 19:20:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 2060 states, 957 states have (on average 2.456635318704284) internal successors, (2351), 2046 states have internal predecessors, (2351), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 19:20:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:20:49,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:20:49,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:20:49,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:20:49,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:20:49,095 INFO L85 PathProgramCache]: Analyzing trace with hash 119657, now seen corresponding path program 1 times [2024-10-11 19:20:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:20:49,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851511959] [2024-10-11 19:20:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:20:49,104 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-10-11 19:20:49,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:20:49,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:20:49,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:20:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:20:49,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:20:49,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:20:49,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:20:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:20:49,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:20:49,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:20:49,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851511959] [2024-10-11 19:20:49,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851511959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:20:49,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:20:49,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:20:49,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154697690] [2024-10-11 19:20:49,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:20:49,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:20:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:20:49,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:20:49,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:20:49,404 INFO L87 Difference]: Start difference. First operand has 2060 states, 957 states have (on average 2.456635318704284) internal successors, (2351), 2046 states have internal predecessors, (2351), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-10-11 19:20:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:20:52,597 INFO L93 Difference]: Finished difference Result 2659 states and 2843 transitions. [2024-10-11 19:20:52,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:20:52,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-11 19:20:52,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:20:52,636 INFO L225 Difference]: With dead ends: 2659 [2024-10-11 19:20:52,636 INFO L226 Difference]: Without dead ends: 2658 [2024-10-11 19:20:52,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 19:20:52,641 INFO L432 NwaCegarLoop]: 1167 mSDtfsCounter, 1946 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1956 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:20:52,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1956 Valid, 1561 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 19:20:52,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-10-11 19:20:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2169. [2024-10-11 19:20:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 1094 states have (on average 2.257769652650823) internal successors, (2470), 2153 states have internal predecessors, (2470), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:20:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2502 transitions. [2024-10-11 19:20:52,749 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2502 transitions. Word has length 2 [2024-10-11 19:20:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:20:52,750 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 2502 transitions. [2024-10-11 19:20:52,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-10-11 19:20:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2502 transitions. [2024-10-11 19:20:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:20:52,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:20:52,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:20:52,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:20:52,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:20:52,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:20:52,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:20:52,954 INFO L85 PathProgramCache]: Analyzing trace with hash 119658, now seen corresponding path program 1 times [2024-10-11 19:20:52,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:20:52,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90794875] [2024-10-11 19:20:52,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:20:52,954 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-10-11 19:20:52,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:20:52,957 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:20:52,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:20:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:20:53,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:20:53,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:20:53,092 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-10-11 19:20:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:20:53,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:20:53,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:20:53,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90794875] [2024-10-11 19:20:53,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90794875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:20:53,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:20:53,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:20:53,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651598619] [2024-10-11 19:20:53,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:20:53,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:20:53,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:20:53,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:20:53,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:20:53,103 INFO L87 Difference]: Start difference. First operand 2169 states and 2502 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-10-11 19:20:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:20:57,350 INFO L93 Difference]: Finished difference Result 2894 states and 3307 transitions. [2024-10-11 19:20:57,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:20:57,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-11 19:20:57,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:20:57,360 INFO L225 Difference]: With dead ends: 2894 [2024-10-11 19:20:57,360 INFO L226 Difference]: Without dead ends: 2894 [2024-10-11 19:20:57,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 19:20:57,361 INFO L432 NwaCegarLoop]: 1683 mSDtfsCounter, 799 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2777 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:20:57,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2777 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 19:20:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2024-10-11 19:20:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2566. [2024-10-11 19:20:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 1489 states have (on average 2.19543317662861) internal successors, (3269), 2547 states have internal predecessors, (3269), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 19:20:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3307 transitions. [2024-10-11 19:20:57,415 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3307 transitions. Word has length 2 [2024-10-11 19:20:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:20:57,415 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 3307 transitions. [2024-10-11 19:20:57,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-10-11 19:20:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3307 transitions. [2024-10-11 19:20:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 19:20:57,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:20:57,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:20:57,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:20:57,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:20:57,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:20:57,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:20:57,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1162343629, now seen corresponding path program 1 times [2024-10-11 19:20:57,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:20:57,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142513550] [2024-10-11 19:20:57,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:20:57,619 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-10-11 19:20:57,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:20:57,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:20:57,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:20:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:20:57,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:20:57,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:20:57,853 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-10-11 19:20:57,859 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-10-11 19:20:57,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:20:57,950 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-10-11 19:20:57,964 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:20:57,965 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-10-11 19:20:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:20:57,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:20:57,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:20:57,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142513550] [2024-10-11 19:20:57,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142513550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:20:57,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:20:57,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:20:57,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147924253] [2024-10-11 19:20:57,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:20:57,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:20:57,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:20:57,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:20:57,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:20:57,984 INFO L87 Difference]: Start difference. First operand 2566 states and 3307 transitions. Second operand has 4 states, 3 states have (on average 2.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-10-11 19:21:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:04,782 INFO L93 Difference]: Finished difference Result 4608 states and 5499 transitions. [2024-10-11 19:21:04,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:04,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.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-10-11 19:21:04,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:04,794 INFO L225 Difference]: With dead ends: 4608 [2024-10-11 19:21:04,795 INFO L226 Difference]: Without dead ends: 4608 [2024-10-11 19:21:04,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-11 19:21:04,796 INFO L432 NwaCegarLoop]: 760 mSDtfsCounter, 3927 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 2804 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3936 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:04,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3936 Valid, 1933 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2804 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-11 19:21:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2024-10-11 19:21:04,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 3140. [2024-10-11 19:21:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3140 states, 2063 states have (on average 2.243819680077557) internal successors, (4629), 3115 states have internal predecessors, (4629), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4679 transitions. [2024-10-11 19:21:04,851 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4679 transitions. Word has length 6 [2024-10-11 19:21:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:04,852 INFO L471 AbstractCegarLoop]: Abstraction has 3140 states and 4679 transitions. [2024-10-11 19:21:04,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.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-10-11 19:21:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4679 transitions. [2024-10-11 19:21:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:21:04,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:04,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:04,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:05,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:05,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:05,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1672914111, now seen corresponding path program 1 times [2024-10-11 19:21:05,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:05,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540965713] [2024-10-11 19:21:05,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:05,058 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-10-11 19:21:05,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:05,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:05,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:05,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:05,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:05,215 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-10-11 19:21:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:05,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:05,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:05,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540965713] [2024-10-11 19:21:05,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540965713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:05,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:05,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:05,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361139756] [2024-10-11 19:21:05,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:05,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:05,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:05,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:05,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:05,227 INFO L87 Difference]: Start difference. First operand 3140 states and 4679 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:08,179 INFO L93 Difference]: Finished difference Result 3776 states and 5273 transitions. [2024-10-11 19:21:08,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:08,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 19:21:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:08,190 INFO L225 Difference]: With dead ends: 3776 [2024-10-11 19:21:08,190 INFO L226 Difference]: Without dead ends: 3776 [2024-10-11 19:21:08,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-11 19:21:08,191 INFO L432 NwaCegarLoop]: 1839 mSDtfsCounter, 1726 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:08,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 2417 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 19:21:08,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3776 states. [2024-10-11 19:21:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3776 to 3048. [2024-10-11 19:21:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 2063 states have (on average 2.1396025206010663) internal successors, (4414), 3023 states have internal predecessors, (4414), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 4464 transitions. [2024-10-11 19:21:08,241 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 4464 transitions. Word has length 7 [2024-10-11 19:21:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:08,242 INFO L471 AbstractCegarLoop]: Abstraction has 3048 states and 4464 transitions. [2024-10-11 19:21:08,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 4464 transitions. [2024-10-11 19:21:08,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:21:08,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:08,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:08,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:08,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:08,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:08,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:08,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1672914110, now seen corresponding path program 1 times [2024-10-11 19:21:08,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:08,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085291806] [2024-10-11 19:21:08,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:08,450 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-10-11 19:21:08,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:08,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:08,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:08,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:21:08,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:08,612 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-10-11 19:21:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:08,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:08,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:08,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085291806] [2024-10-11 19:21:08,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085291806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:08,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:08,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:08,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127642298] [2024-10-11 19:21:08,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:08,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:08,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:08,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:08,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:08,651 INFO L87 Difference]: Start difference. First operand 3048 states and 4464 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:12,311 INFO L93 Difference]: Finished difference Result 4617 states and 6688 transitions. [2024-10-11 19:21:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:12,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 19:21:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:12,330 INFO L225 Difference]: With dead ends: 4617 [2024-10-11 19:21:12,330 INFO L226 Difference]: Without dead ends: 4617 [2024-10-11 19:21:12,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-11 19:21:12,332 INFO L432 NwaCegarLoop]: 2133 mSDtfsCounter, 1285 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:12,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 3048 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 19:21:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2024-10-11 19:21:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 3316. [2024-10-11 19:21:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3316 states, 2341 states have (on average 2.126441691584793) internal successors, (4978), 3291 states have internal predecessors, (4978), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 5028 transitions. [2024-10-11 19:21:12,391 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 5028 transitions. Word has length 7 [2024-10-11 19:21:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:12,391 INFO L471 AbstractCegarLoop]: Abstraction has 3316 states and 5028 transitions. [2024-10-11 19:21:12,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 5028 transitions. [2024-10-11 19:21:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 19:21:12,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:12,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:12,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 19:21:12,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:12,593 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:12,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:12,593 INFO L85 PathProgramCache]: Analyzing trace with hash -286775368, now seen corresponding path program 1 times [2024-10-11 19:21:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:12,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293546803] [2024-10-11 19:21:12,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:12,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:12,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:12,595 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:12,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:12,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:21:12,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:12,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:12,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:12,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293546803] [2024-10-11 19:21:12,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293546803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:12,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:12,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:12,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903615212] [2024-10-11 19:21:12,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:12,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:12,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:12,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:12,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:12,738 INFO L87 Difference]: Start difference. First operand 3316 states and 5028 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:13,753 INFO L93 Difference]: Finished difference Result 3262 states and 4948 transitions. [2024-10-11 19:21:13,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:13,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 19:21:13,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:13,763 INFO L225 Difference]: With dead ends: 3262 [2024-10-11 19:21:13,763 INFO L226 Difference]: Without dead ends: 3262 [2024-10-11 19:21:13,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:13,764 INFO L432 NwaCegarLoop]: 1805 mSDtfsCounter, 61 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:13,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3568 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 19:21:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2024-10-11 19:21:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3262. [2024-10-11 19:21:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3262 states, 2311 states have (on average 2.119428818693206) internal successors, (4898), 3237 states have internal predecessors, (4898), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4948 transitions. [2024-10-11 19:21:13,806 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4948 transitions. Word has length 10 [2024-10-11 19:21:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:13,806 INFO L471 AbstractCegarLoop]: Abstraction has 3262 states and 4948 transitions. [2024-10-11 19:21:13,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4948 transitions. [2024-10-11 19:21:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 19:21:13,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:13,807 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:13,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 19:21:14,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:14,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:14,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:14,011 INFO L85 PathProgramCache]: Analyzing trace with hash -713168110, now seen corresponding path program 1 times [2024-10-11 19:21:14,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:14,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168350584] [2024-10-11 19:21:14,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:14,012 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-10-11 19:21:14,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:14,013 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:14,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:14,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:14,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:14,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:14,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:14,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168350584] [2024-10-11 19:21:14,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168350584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:14,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:14,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:14,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468401951] [2024-10-11 19:21:14,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:14,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:14,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:14,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:14,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:14,183 INFO L87 Difference]: Start difference. First operand 3262 states and 4948 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-10-11 19:21:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:15,507 INFO L93 Difference]: Finished difference Result 3246 states and 4904 transitions. [2024-10-11 19:21:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:21:15,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-10-11 19:21:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:15,524 INFO L225 Difference]: With dead ends: 3246 [2024-10-11 19:21:15,524 INFO L226 Difference]: Without dead ends: 3246 [2024-10-11 19:21:15,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-10-11 19:21:15,525 INFO L432 NwaCegarLoop]: 1774 mSDtfsCounter, 45 mSDsluCounter, 3530 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5304 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:15,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5304 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 19:21:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2024-10-11 19:21:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3246. [2024-10-11 19:21:15,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 2309 states have (on average 2.1022087483759204) internal successors, (4854), 3221 states have internal predecessors, (4854), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 4904 transitions. [2024-10-11 19:21:15,634 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 4904 transitions. Word has length 12 [2024-10-11 19:21:15,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:15,638 INFO L471 AbstractCegarLoop]: Abstraction has 3246 states and 4904 transitions. [2024-10-11 19:21:15,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-10-11 19:21:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 4904 transitions. [2024-10-11 19:21:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 19:21:15,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:15,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:15,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:15,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:15,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:15,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:15,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1884128953, now seen corresponding path program 1 times [2024-10-11 19:21:15,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:15,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466231339] [2024-10-11 19:21:15,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:15,842 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-10-11 19:21:15,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:15,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:15,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:16,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:21:16,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:16,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:16,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:16,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:16,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466231339] [2024-10-11 19:21:16,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466231339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:16,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:16,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:16,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138824886] [2024-10-11 19:21:16,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:16,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:16,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:16,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:16,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:16,062 INFO L87 Difference]: Start difference. First operand 3246 states and 4904 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-10-11 19:21:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:16,987 INFO L93 Difference]: Finished difference Result 3132 states and 4664 transitions. [2024-10-11 19:21:16,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:16,989 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-10-11 19:21:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:16,995 INFO L225 Difference]: With dead ends: 3132 [2024-10-11 19:21:16,995 INFO L226 Difference]: Without dead ends: 3132 [2024-10-11 19:21:16,996 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-10-11 19:21:16,996 INFO L432 NwaCegarLoop]: 1747 mSDtfsCounter, 61 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3452 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:16,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3452 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 19:21:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2024-10-11 19:21:17,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 3132. [2024-10-11 19:21:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 2219 states have (on average 2.079315006759802) internal successors, (4614), 3107 states have internal predecessors, (4614), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 4664 transitions. [2024-10-11 19:21:17,036 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 4664 transitions. Word has length 17 [2024-10-11 19:21:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:17,036 INFO L471 AbstractCegarLoop]: Abstraction has 3132 states and 4664 transitions. [2024-10-11 19:21:17,036 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-10-11 19:21:17,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 4664 transitions. [2024-10-11 19:21:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 19:21:17,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:17,037 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:17,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:17,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:17,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:17,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:17,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2141973639, now seen corresponding path program 1 times [2024-10-11 19:21:17,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:17,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978090976] [2024-10-11 19:21:17,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:17,240 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-10-11 19:21:17,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:17,241 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:17,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:17,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:21:17,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:17,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:17,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:17,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978090976] [2024-10-11 19:21:17,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978090976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:17,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:17,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:17,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940975159] [2024-10-11 19:21:17,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:17,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:17,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:17,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:17,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:17,444 INFO L87 Difference]: Start difference. First operand 3132 states and 4664 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-10-11 19:21:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:18,265 INFO L93 Difference]: Finished difference Result 3078 states and 4584 transitions. [2024-10-11 19:21:18,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:18,266 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-10-11 19:21:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:18,271 INFO L225 Difference]: With dead ends: 3078 [2024-10-11 19:21:18,272 INFO L226 Difference]: Without dead ends: 3078 [2024-10-11 19:21:18,272 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-10-11 19:21:18,273 INFO L432 NwaCegarLoop]: 1710 mSDtfsCounter, 61 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:18,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3378 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:21:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2024-10-11 19:21:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 3078. [2024-10-11 19:21:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 2189 states have (on average 2.0712654179990864) internal successors, (4534), 3053 states have internal predecessors, (4534), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4584 transitions. [2024-10-11 19:21:18,307 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4584 transitions. Word has length 17 [2024-10-11 19:21:18,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:18,307 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 4584 transitions. [2024-10-11 19:21:18,308 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-10-11 19:21:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4584 transitions. [2024-10-11 19:21:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 19:21:18,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:18,308 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-10-11 19:21:18,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:18,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:18,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:18,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:18,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1828249453, now seen corresponding path program 1 times [2024-10-11 19:21:18,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:18,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840402670] [2024-10-11 19:21:18,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:18,510 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-10-11 19:21:18,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:18,513 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:18,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:18,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:18,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:18,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:18,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:18,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840402670] [2024-10-11 19:21:18,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840402670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:18,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:18,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:18,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039097187] [2024-10-11 19:21:18,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:18,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:18,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:18,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:18,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:18,700 INFO L87 Difference]: Start difference. First operand 3078 states and 4584 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-10-11 19:21:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:20,051 INFO L93 Difference]: Finished difference Result 3058 states and 4452 transitions. [2024-10-11 19:21:20,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:21:20,054 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-10-11 19:21:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:20,060 INFO L225 Difference]: With dead ends: 3058 [2024-10-11 19:21:20,061 INFO L226 Difference]: Without dead ends: 3058 [2024-10-11 19:21:20,061 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-10-11 19:21:20,062 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 45 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5019 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:20,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5019 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 19:21:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2024-10-11 19:21:20,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 3058. [2024-10-11 19:21:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 2183 states have (on average 2.016491067338525) internal successors, (4402), 3033 states have internal predecessors, (4402), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 4452 transitions. [2024-10-11 19:21:20,106 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 4452 transitions. Word has length 19 [2024-10-11 19:21:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:20,106 INFO L471 AbstractCegarLoop]: Abstraction has 3058 states and 4452 transitions. [2024-10-11 19:21:20,107 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-10-11 19:21:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 4452 transitions. [2024-10-11 19:21:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 19:21:20,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:20,108 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-10-11 19:21:20,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 19:21:20,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:20,309 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:20,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:20,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1147334253, now seen corresponding path program 1 times [2024-10-11 19:21:20,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:20,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472760453] [2024-10-11 19:21:20,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:20,310 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-10-11 19:21:20,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:20,313 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:20,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:20,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:20,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:20,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:20,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472760453] [2024-10-11 19:21:20,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472760453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:20,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:20,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099394691] [2024-10-11 19:21:20,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:20,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:20,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:20,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:20,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:20,557 INFO L87 Difference]: Start difference. First operand 3058 states and 4452 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-10-11 19:21:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:21,760 INFO L93 Difference]: Finished difference Result 3042 states and 4408 transitions. [2024-10-11 19:21:21,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:21:21,763 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-10-11 19:21:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:21,769 INFO L225 Difference]: With dead ends: 3042 [2024-10-11 19:21:21,769 INFO L226 Difference]: Without dead ends: 3042 [2024-10-11 19:21:21,769 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-10-11 19:21:21,770 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 45 mSDsluCounter, 3298 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4956 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:21,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4956 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:21:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2024-10-11 19:21:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 3042. [2024-10-11 19:21:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3042 states, 2181 states have (on average 1.9981659789087574) internal successors, (4358), 3017 states have internal predecessors, (4358), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 4408 transitions. [2024-10-11 19:21:21,803 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 4408 transitions. Word has length 19 [2024-10-11 19:21:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:21,803 INFO L471 AbstractCegarLoop]: Abstraction has 3042 states and 4408 transitions. [2024-10-11 19:21:21,804 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-10-11 19:21:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 4408 transitions. [2024-10-11 19:21:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 19:21:21,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:21,804 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] [2024-10-11 19:21:21,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 19:21:22,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:22,005 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:22,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:22,005 INFO L85 PathProgramCache]: Analyzing trace with hash 303308928, now seen corresponding path program 1 times [2024-10-11 19:21:22,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:22,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12690338] [2024-10-11 19:21:22,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:22,006 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-10-11 19:21:22,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:22,008 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:22,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:22,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:21:22,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:22,173 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-10-11 19:21:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:22,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:22,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12690338] [2024-10-11 19:21:22,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12690338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:22,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:22,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483734415] [2024-10-11 19:21:22,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:22,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:22,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:22,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:22,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:22,225 INFO L87 Difference]: Start difference. First operand 3042 states and 4408 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-10-11 19:21:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:25,345 INFO L93 Difference]: Finished difference Result 3460 states and 4733 transitions. [2024-10-11 19:21:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:25,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-11 19:21:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:25,351 INFO L225 Difference]: With dead ends: 3460 [2024-10-11 19:21:25,351 INFO L226 Difference]: Without dead ends: 3460 [2024-10-11 19:21:25,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-10-11 19:21:25,352 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 1666 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:25,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 2354 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 19:21:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2024-10-11 19:21:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3038. [2024-10-11 19:21:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3038 states, 2181 states have (on average 1.9944979367262723) internal successors, (4350), 3013 states have internal predecessors, (4350), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 4400 transitions. [2024-10-11 19:21:25,399 INFO L78 Accepts]: Start accepts. Automaton has 3038 states and 4400 transitions. Word has length 26 [2024-10-11 19:21:25,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:25,400 INFO L471 AbstractCegarLoop]: Abstraction has 3038 states and 4400 transitions. [2024-10-11 19:21:25,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-10-11 19:21:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 4400 transitions. [2024-10-11 19:21:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 19:21:25,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:25,402 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] [2024-10-11 19:21:25,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 19:21:25,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:25,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:25,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:25,603 INFO L85 PathProgramCache]: Analyzing trace with hash 303308929, now seen corresponding path program 1 times [2024-10-11 19:21:25,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:25,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417827438] [2024-10-11 19:21:25,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:25,604 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-10-11 19:21:25,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:25,606 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:25,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:25,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:21:25,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:25,761 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-10-11 19:21:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:25,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:25,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:25,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417827438] [2024-10-11 19:21:25,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417827438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:25,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:25,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951710384] [2024-10-11 19:21:25,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:25,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:25,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:25,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:25,902 INFO L87 Difference]: Start difference. First operand 3038 states and 4400 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-10-11 19:21:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:29,851 INFO L93 Difference]: Finished difference Result 3706 states and 5140 transitions. [2024-10-11 19:21:29,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:29,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-11 19:21:29,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:29,858 INFO L225 Difference]: With dead ends: 3706 [2024-10-11 19:21:29,858 INFO L226 Difference]: Without dead ends: 3706 [2024-10-11 19:21:29,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-10-11 19:21:29,859 INFO L432 NwaCegarLoop]: 1435 mSDtfsCounter, 737 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 2338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:29,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 3249 Invalid, 2338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 19:21:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2024-10-11 19:21:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3071. [2024-10-11 19:21:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3071 states, 2214 states have (on average 1.98193315266486) internal successors, (4388), 3046 states have internal predecessors, (4388), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4438 transitions. [2024-10-11 19:21:29,892 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4438 transitions. Word has length 26 [2024-10-11 19:21:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:29,892 INFO L471 AbstractCegarLoop]: Abstraction has 3071 states and 4438 transitions. [2024-10-11 19:21:29,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-10-11 19:21:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4438 transitions. [2024-10-11 19:21:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 19:21:29,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:29,893 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-10-11 19:21:29,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 19:21:30,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:30,097 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:30,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash 575845249, now seen corresponding path program 1 times [2024-10-11 19:21:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:30,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706889144] [2024-10-11 19:21:30,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:30,098 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-10-11 19:21:30,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:30,101 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:30,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:30,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:21:30,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:30,296 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-10-11 19:21:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:30,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:30,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706889144] [2024-10-11 19:21:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706889144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:30,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:30,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:30,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813096473] [2024-10-11 19:21:30,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:30,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:30,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:30,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:30,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:30,355 INFO L87 Difference]: Start difference. First operand 3071 states and 4438 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-10-11 19:21:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:33,822 INFO L93 Difference]: Finished difference Result 3724 states and 5139 transitions. [2024-10-11 19:21:33,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:33,822 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-10-11 19:21:33,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:33,827 INFO L225 Difference]: With dead ends: 3724 [2024-10-11 19:21:33,828 INFO L226 Difference]: Without dead ends: 3724 [2024-10-11 19:21:33,828 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-10-11 19:21:33,828 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1526 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 2675 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:33,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 3531 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2675 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 19:21:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2024-10-11 19:21:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3067. [2024-10-11 19:21:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 2214 states have (on average 1.971093044263776) internal successors, (4364), 3042 states have internal predecessors, (4364), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4414 transitions. [2024-10-11 19:21:33,859 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4414 transitions. Word has length 33 [2024-10-11 19:21:33,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:33,859 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4414 transitions. [2024-10-11 19:21:33,859 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-10-11 19:21:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4414 transitions. [2024-10-11 19:21:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 19:21:33,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:33,860 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-10-11 19:21:33,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:34,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:34,061 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:34,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash 575845250, now seen corresponding path program 1 times [2024-10-11 19:21:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:34,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354188387] [2024-10-11 19:21:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:34,062 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-10-11 19:21:34,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:34,066 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:34,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:34,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:21:34,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:34,250 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-10-11 19:21:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:34,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:34,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:34,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354188387] [2024-10-11 19:21:34,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354188387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:34,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:34,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:34,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495741752] [2024-10-11 19:21:34,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:34,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:34,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:34,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:34,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:34,423 INFO L87 Difference]: Start difference. First operand 3067 states and 4414 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-10-11 19:21:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:39,341 INFO L93 Difference]: Finished difference Result 4256 states and 5942 transitions. [2024-10-11 19:21:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:39,341 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-10-11 19:21:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:39,347 INFO L225 Difference]: With dead ends: 4256 [2024-10-11 19:21:39,348 INFO L226 Difference]: Without dead ends: 4256 [2024-10-11 19:21:39,348 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-10-11 19:21:39,348 INFO L432 NwaCegarLoop]: 1975 mSDtfsCounter, 1081 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:39,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 4162 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-11 19:21:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4256 states. [2024-10-11 19:21:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4256 to 3067. [2024-10-11 19:21:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 2214 states have (on average 1.967479674796748) internal successors, (4356), 3042 states have internal predecessors, (4356), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4406 transitions. [2024-10-11 19:21:39,378 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4406 transitions. Word has length 33 [2024-10-11 19:21:39,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:39,378 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4406 transitions. [2024-10-11 19:21:39,378 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-10-11 19:21:39,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4406 transitions. [2024-10-11 19:21:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 19:21:39,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:39,379 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-10-11 19:21:39,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:39,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:39,580 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:39,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:39,580 INFO L85 PathProgramCache]: Analyzing trace with hash 601006657, now seen corresponding path program 1 times [2024-10-11 19:21:39,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:39,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754014240] [2024-10-11 19:21:39,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:39,581 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-10-11 19:21:39,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:39,583 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:39,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:39,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:21:39,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:39,763 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-10-11 19:21:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:39,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:39,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:39,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754014240] [2024-10-11 19:21:39,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754014240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:39,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:39,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:39,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521503999] [2024-10-11 19:21:39,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:39,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:39,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:39,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:39,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:39,811 INFO L87 Difference]: Start difference. First operand 3067 states and 4406 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-10-11 19:21:42,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:42,754 INFO L93 Difference]: Finished difference Result 3704 states and 5107 transitions. [2024-10-11 19:21:42,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:42,754 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-10-11 19:21:42,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:42,764 INFO L225 Difference]: With dead ends: 3704 [2024-10-11 19:21:42,768 INFO L226 Difference]: Without dead ends: 3704 [2024-10-11 19:21:42,768 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-10-11 19:21:42,769 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1522 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:42,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 3531 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 19:21:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2024-10-11 19:21:42,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3063. [2024-10-11 19:21:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 2214 states have (on average 1.96386630532972) internal successors, (4348), 3038 states have internal predecessors, (4348), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4398 transitions. [2024-10-11 19:21:42,812 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4398 transitions. Word has length 33 [2024-10-11 19:21:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:42,812 INFO L471 AbstractCegarLoop]: Abstraction has 3063 states and 4398 transitions. [2024-10-11 19:21:42,813 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-10-11 19:21:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4398 transitions. [2024-10-11 19:21:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 19:21:42,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:42,813 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-10-11 19:21:42,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:43,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:43,014 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:43,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:43,015 INFO L85 PathProgramCache]: Analyzing trace with hash 601006658, now seen corresponding path program 1 times [2024-10-11 19:21:43,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:43,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162467240] [2024-10-11 19:21:43,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:43,015 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-10-11 19:21:43,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:43,019 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:43,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:43,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:21:43,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:43,201 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-10-11 19:21:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:43,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:43,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:43,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162467240] [2024-10-11 19:21:43,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162467240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:43,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:43,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:43,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112392202] [2024-10-11 19:21:43,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:43,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:43,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:43,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:43,311 INFO L87 Difference]: Start difference. First operand 3063 states and 4398 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-10-11 19:21:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:47,481 INFO L93 Difference]: Finished difference Result 4248 states and 5926 transitions. [2024-10-11 19:21:47,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:47,481 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-10-11 19:21:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:47,486 INFO L225 Difference]: With dead ends: 4248 [2024-10-11 19:21:47,486 INFO L226 Difference]: Without dead ends: 4248 [2024-10-11 19:21:47,486 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-10-11 19:21:47,488 INFO L432 NwaCegarLoop]: 1971 mSDtfsCounter, 1073 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 2784 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 4127 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:47,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 4127 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2784 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 19:21:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4248 states. [2024-10-11 19:21:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4248 to 3059. [2024-10-11 19:21:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 2214 states have (on average 1.960252935862692) internal successors, (4340), 3034 states have internal predecessors, (4340), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 4390 transitions. [2024-10-11 19:21:47,537 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 4390 transitions. Word has length 33 [2024-10-11 19:21:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:47,537 INFO L471 AbstractCegarLoop]: Abstraction has 3059 states and 4390 transitions. [2024-10-11 19:21:47,537 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-10-11 19:21:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 4390 transitions. [2024-10-11 19:21:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 19:21:47,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:47,538 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] [2024-10-11 19:21:47,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-11 19:21:47,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:47,739 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:47,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:47,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1877036666, now seen corresponding path program 1 times [2024-10-11 19:21:47,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:47,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918947016] [2024-10-11 19:21:47,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:47,740 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-10-11 19:21:47,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:47,742 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:47,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:47,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:47,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:47,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:47,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:47,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918947016] [2024-10-11 19:21:47,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918947016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:47,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:47,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825337716] [2024-10-11 19:21:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:47,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:47,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:47,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:47,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:47,948 INFO L87 Difference]: Start difference. First operand 3059 states and 4390 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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-10-11 19:21:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:49,044 INFO L93 Difference]: Finished difference Result 3047 states and 4366 transitions. [2024-10-11 19:21:49,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:21:49,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-11 19:21:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:49,048 INFO L225 Difference]: With dead ends: 3047 [2024-10-11 19:21:49,048 INFO L226 Difference]: Without dead ends: 3047 [2024-10-11 19:21:49,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-10-11 19:21:49,049 INFO L432 NwaCegarLoop]: 1644 mSDtfsCounter, 21 mSDsluCounter, 3265 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4909 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:49,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4909 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:21:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3047 states. [2024-10-11 19:21:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3047 to 3047. [2024-10-11 19:21:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3047 states, 2202 states have (on average 1.9600363306085378) internal successors, (4316), 3022 states have internal predecessors, (4316), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:21:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 3047 states and 4366 transitions. [2024-10-11 19:21:49,095 INFO L78 Accepts]: Start accepts. Automaton has 3047 states and 4366 transitions. Word has length 40 [2024-10-11 19:21:49,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:49,096 INFO L471 AbstractCegarLoop]: Abstraction has 3047 states and 4366 transitions. [2024-10-11 19:21:49,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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-10-11 19:21:49,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 4366 transitions. [2024-10-11 19:21:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 19:21:49,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:49,096 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] [2024-10-11 19:21:49,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:49,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:49,297 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:49,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:49,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1228682057, now seen corresponding path program 1 times [2024-10-11 19:21:49,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:49,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328177217] [2024-10-11 19:21:49,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:49,299 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-10-11 19:21:49,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:49,300 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:49,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:49,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:49,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:49,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:49,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:49,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328177217] [2024-10-11 19:21:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328177217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:49,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:49,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:49,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574808044] [2024-10-11 19:21:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:49,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:49,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:49,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:49,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:49,622 INFO L87 Difference]: Start difference. First operand 3047 states and 4366 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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-10-11 19:21:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:50,985 INFO L93 Difference]: Finished difference Result 4508 states and 6234 transitions. [2024-10-11 19:21:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:50,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-11 19:21:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:50,990 INFO L225 Difference]: With dead ends: 4508 [2024-10-11 19:21:50,990 INFO L226 Difference]: Without dead ends: 4508 [2024-10-11 19:21:50,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-10-11 19:21:50,991 INFO L432 NwaCegarLoop]: 1712 mSDtfsCounter, 1175 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:50,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 3274 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 19:21:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2024-10-11 19:21:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 3928. [2024-10-11 19:21:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3928 states, 3076 states have (on average 1.944408322496749) internal successors, (5981), 3893 states have internal predecessors, (5981), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 19:21:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 6051 transitions. [2024-10-11 19:21:51,027 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 6051 transitions. Word has length 44 [2024-10-11 19:21:51,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:51,028 INFO L471 AbstractCegarLoop]: Abstraction has 3928 states and 6051 transitions. [2024-10-11 19:21:51,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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-10-11 19:21:51,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 6051 transitions. [2024-10-11 19:21:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 19:21:51,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:51,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:51,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-11 19:21:51,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:51,229 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:51,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:51,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1257793787, now seen corresponding path program 1 times [2024-10-11 19:21:51,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:51,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38306509] [2024-10-11 19:21:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:51,230 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-10-11 19:21:51,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:51,233 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:51,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-11 19:21:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:51,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:51,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:51,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:51,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:51,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38306509] [2024-10-11 19:21:51,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38306509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:51,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:51,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:51,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21621957] [2024-10-11 19:21:51,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:51,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:51,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:51,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:51,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:51,483 INFO L87 Difference]: Start difference. First operand 3928 states and 6051 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:52,599 INFO L93 Difference]: Finished difference Result 3886 states and 5981 transitions. [2024-10-11 19:21:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:21:52,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 19:21:52,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:52,604 INFO L225 Difference]: With dead ends: 3886 [2024-10-11 19:21:52,604 INFO L226 Difference]: Without dead ends: 3886 [2024-10-11 19:21:52,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-10-11 19:21:52,605 INFO L432 NwaCegarLoop]: 1640 mSDtfsCounter, 21 mSDsluCounter, 3257 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4897 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:52,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4897 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:21:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2024-10-11 19:21:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3886. [2024-10-11 19:21:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3034 states have (on average 1.9482531311799605) internal successors, (5911), 3851 states have internal predecessors, (5911), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 19:21:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 5981 transitions. [2024-10-11 19:21:52,663 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 5981 transitions. Word has length 49 [2024-10-11 19:21:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:52,664 INFO L471 AbstractCegarLoop]: Abstraction has 3886 states and 5981 transitions. [2024-10-11 19:21:52,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 5981 transitions. [2024-10-11 19:21:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 19:21:52,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:52,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:52,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-11 19:21:52,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:52,865 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:52,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1745245856, now seen corresponding path program 1 times [2024-10-11 19:21:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:52,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661984197] [2024-10-11 19:21:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:52,867 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-10-11 19:21:52,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:52,869 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:52,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-11 19:21:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:53,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:53,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:53,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:53,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:53,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661984197] [2024-10-11 19:21:53,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661984197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:53,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:53,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785071029] [2024-10-11 19:21:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:53,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:53,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:53,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:53,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:53,176 INFO L87 Difference]: Start difference. First operand 3886 states and 5981 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:54,355 INFO L93 Difference]: Finished difference Result 3868 states and 5951 transitions. [2024-10-11 19:21:54,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:21:54,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 19:21:54,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:54,360 INFO L225 Difference]: With dead ends: 3868 [2024-10-11 19:21:54,360 INFO L226 Difference]: Without dead ends: 3868 [2024-10-11 19:21:54,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:21:54,361 INFO L432 NwaCegarLoop]: 1636 mSDtfsCounter, 15 mSDsluCounter, 3255 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4891 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:54,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 4891 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:21:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2024-10-11 19:21:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3868. [2024-10-11 19:21:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3868 states, 3016 states have (on average 1.9499336870026525) internal successors, (5881), 3833 states have internal predecessors, (5881), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 19:21:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 5951 transitions. [2024-10-11 19:21:54,402 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 5951 transitions. Word has length 52 [2024-10-11 19:21:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:54,402 INFO L471 AbstractCegarLoop]: Abstraction has 3868 states and 5951 transitions. [2024-10-11 19:21:54,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 5951 transitions. [2024-10-11 19:21:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 19:21:54,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:54,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:54,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-11 19:21:54,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:54,604 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:54,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash -165141037, now seen corresponding path program 1 times [2024-10-11 19:21:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:54,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586917160] [2024-10-11 19:21:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:54,605 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-10-11 19:21:54,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:54,607 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:54,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-11 19:21:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:54,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:21:54,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:54,840 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:21:54,841 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:21:54,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-11 19:21:54,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:21:54,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-10-11 19:21:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:54,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:54,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:54,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586917160] [2024-10-11 19:21:54,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586917160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:54,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:54,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:54,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826521745] [2024-10-11 19:21:54,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:54,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:54,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:54,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:54,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:54,890 INFO L87 Difference]: Start difference. First operand 3868 states and 5951 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:57,320 INFO L93 Difference]: Finished difference Result 5120 states and 7760 transitions. [2024-10-11 19:21:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:57,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 19:21:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:57,330 INFO L225 Difference]: With dead ends: 5120 [2024-10-11 19:21:57,330 INFO L226 Difference]: Without dead ends: 5120 [2024-10-11 19:21:57,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:21:57,333 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 1535 mSDsluCounter, 2549 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 4139 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:57,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 4139 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 19:21:57,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5120 states. [2024-10-11 19:21:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5120 to 3837. [2024-10-11 19:21:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 2985 states have (on average 1.959463986599665) internal successors, (5849), 3802 states have internal predecessors, (5849), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 19:21:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5919 transitions. [2024-10-11 19:21:57,392 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5919 transitions. Word has length 55 [2024-10-11 19:21:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:57,392 INFO L471 AbstractCegarLoop]: Abstraction has 3837 states and 5919 transitions. [2024-10-11 19:21:57,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:57,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5919 transitions. [2024-10-11 19:21:57,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 19:21:57,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:57,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 19:21:57,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-10-11 19:21:57,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:57,594 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:57,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:57,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1835739427, now seen corresponding path program 1 times [2024-10-11 19:21:57,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:57,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624861470] [2024-10-11 19:21:57,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:57,595 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-10-11 19:21:57,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:57,597 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:57,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-11 19:21:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:57,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:57,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:58,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:58,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:58,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624861470] [2024-10-11 19:21:58,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624861470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:58,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:58,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:58,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83764700] [2024-10-11 19:21:58,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:58,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:58,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:58,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:58,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:58,141 INFO L87 Difference]: Start difference. First operand 3837 states and 5919 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:59,248 INFO L93 Difference]: Finished difference Result 5288 states and 7837 transitions. [2024-10-11 19:21:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:59,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-11 19:21:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:59,254 INFO L225 Difference]: With dead ends: 5288 [2024-10-11 19:21:59,255 INFO L226 Difference]: Without dead ends: 5288 [2024-10-11 19:21:59,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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-10-11 19:21:59,255 INFO L432 NwaCegarLoop]: 1936 mSDtfsCounter, 914 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 3526 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:59,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 3526 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:21:59,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5288 states. [2024-10-11 19:21:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5288 to 4758. [2024-10-11 19:21:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4758 states, 3898 states have (on average 1.9304771677783479) internal successors, (7525), 4712 states have internal predecessors, (7525), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 19:21:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 7617 transitions. [2024-10-11 19:21:59,298 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 7617 transitions. Word has length 53 [2024-10-11 19:21:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:59,299 INFO L471 AbstractCegarLoop]: Abstraction has 4758 states and 7617 transitions. [2024-10-11 19:21:59,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 7617 transitions. [2024-10-11 19:21:59,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 19:21:59,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:59,299 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] [2024-10-11 19:21:59,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-10-11 19:21:59,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:59,500 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:21:59,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash -801247076, now seen corresponding path program 1 times [2024-10-11 19:21:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:59,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024233652] [2024-10-11 19:21:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:59,501 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-10-11 19:21:59,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:59,503 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:21:59,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-11 19:21:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:59,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:21:59,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:59,825 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:21:59,825 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:21:59,826 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:21:59,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-11 19:21:59,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:21:59,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-11 19:21:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:59,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:59,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:59,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024233652] [2024-10-11 19:21:59,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024233652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:59,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:59,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:59,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712898034] [2024-10-11 19:21:59,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:59,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:59,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:59,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:59,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:59,951 INFO L87 Difference]: Start difference. First operand 4758 states and 7617 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-11 19:22:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:01,925 INFO L93 Difference]: Finished difference Result 5075 states and 7696 transitions. [2024-10-11 19:22:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:01,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-10-11 19:22:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:01,930 INFO L225 Difference]: With dead ends: 5075 [2024-10-11 19:22:01,930 INFO L226 Difference]: Without dead ends: 5075 [2024-10-11 19:22:01,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:01,931 INFO L432 NwaCegarLoop]: 1818 mSDtfsCounter, 770 mSDsluCounter, 3393 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 5211 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:01,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 5211 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 19:22:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5075 states. [2024-10-11 19:22:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5075 to 4390. [2024-10-11 19:22:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4390 states, 3530 states have (on average 1.954674220963173) internal successors, (6900), 4347 states have internal predecessors, (6900), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 19:22:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4390 states to 4390 states and 6986 transitions. [2024-10-11 19:22:01,968 INFO L78 Accepts]: Start accepts. Automaton has 4390 states and 6986 transitions. Word has length 56 [2024-10-11 19:22:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:01,968 INFO L471 AbstractCegarLoop]: Abstraction has 4390 states and 6986 transitions. [2024-10-11 19:22:01,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-11 19:22:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4390 states and 6986 transitions. [2024-10-11 19:22:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 19:22:01,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:01,969 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] [2024-10-11 19:22:01,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-10-11 19:22:02,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:22:02,169 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:22:02,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1136067489, now seen corresponding path program 1 times [2024-10-11 19:22:02,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:02,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358614297] [2024-10-11 19:22:02,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:02,171 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-10-11 19:22:02,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:02,173 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:22:02,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-11 19:22:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:02,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:22:02,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:02,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:22:02,504 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-10-11 19:22:02,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:22:02,822 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-10-11 19:22:02,830 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:22:02,830 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-10-11 19:22:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:02,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:02,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:02,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358614297] [2024-10-11 19:22:02,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358614297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:02,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:02,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:22:02,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340317639] [2024-10-11 19:22:02,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:02,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:02,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:02,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:02,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:02,843 INFO L87 Difference]: Start difference. First operand 4390 states and 6986 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-11 19:22:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:05,547 INFO L93 Difference]: Finished difference Result 4306 states and 6743 transitions. [2024-10-11 19:22:05,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:05,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-10-11 19:22:05,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:05,553 INFO L225 Difference]: With dead ends: 4306 [2024-10-11 19:22:05,553 INFO L226 Difference]: Without dead ends: 4306 [2024-10-11 19:22:05,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 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-10-11 19:22:05,554 INFO L432 NwaCegarLoop]: 660 mSDtfsCounter, 1448 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:05,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 834 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 19:22:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4306 states. [2024-10-11 19:22:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4306 to 4196. [2024-10-11 19:22:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4196 states, 3420 states have (on average 1.8804093567251463) internal successors, (6431), 4153 states have internal predecessors, (6431), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 19:22:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 6517 transitions. [2024-10-11 19:22:05,614 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 6517 transitions. Word has length 56 [2024-10-11 19:22:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:05,615 INFO L471 AbstractCegarLoop]: Abstraction has 4196 states and 6517 transitions. [2024-10-11 19:22:05,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-11 19:22:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 6517 transitions. [2024-10-11 19:22:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 19:22:05,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:05,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:05,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-10-11 19:22:05,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:22:05,816 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:22:05,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:05,816 INFO L85 PathProgramCache]: Analyzing trace with hash -34246570, now seen corresponding path program 1 times [2024-10-11 19:22:05,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:05,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278891484] [2024-10-11 19:22:05,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:05,817 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-10-11 19:22:05,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:05,820 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:22:05,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-11 19:22:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:06,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:22:06,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:06,104 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-10-11 19:22:06,118 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-10-11 19:22:06,137 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-10-11 19:22:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:06,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:06,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278891484] [2024-10-11 19:22:06,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278891484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:06,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:06,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182627861] [2024-10-11 19:22:06,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:06,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:22:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:06,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:22:06,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:06,149 INFO L87 Difference]: Start difference. First operand 4196 states and 6517 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:09,100 INFO L93 Difference]: Finished difference Result 4195 states and 6514 transitions. [2024-10-11 19:22:09,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:22:09,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-11 19:22:09,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:09,106 INFO L225 Difference]: With dead ends: 4195 [2024-10-11 19:22:09,106 INFO L226 Difference]: Without dead ends: 4195 [2024-10-11 19:22:09,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-10-11 19:22:09,107 INFO L432 NwaCegarLoop]: 1564 mSDtfsCounter, 2 mSDsluCounter, 2711 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4275 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:09,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4275 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2729 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 19:22:09,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2024-10-11 19:22:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 4195. [2024-10-11 19:22:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4195 states, 3420 states have (on average 1.87953216374269) internal successors, (6428), 4152 states have internal predecessors, (6428), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 19:22:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6514 transitions. [2024-10-11 19:22:09,163 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6514 transitions. Word has length 60 [2024-10-11 19:22:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:09,163 INFO L471 AbstractCegarLoop]: Abstraction has 4195 states and 6514 transitions. [2024-10-11 19:22:09,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6514 transitions. [2024-10-11 19:22:09,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 19:22:09,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:09,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 19:22:09,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-10-11 19:22:09,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:22:09,370 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:22:09,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash -34246569, now seen corresponding path program 1 times [2024-10-11 19:22:09,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:09,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014472013] [2024-10-11 19:22:09,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:09,371 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-10-11 19:22:09,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:09,373 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:22:09,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-10-11 19:22:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:09,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:22:09,648 INFO L278 TraceCheckSpWp]: Computing forward predicates...