./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_OAT_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:56:25,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:56:25,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:56:25,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:56:25,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:56:25,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:56:25,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:56:25,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:56:25,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:56:25,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:56:25,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:56:25,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:56:25,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:56:25,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:56:25,442 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:56:25,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:56:25,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:56:25,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:56:25,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:56:25,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:56:25,450 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:56:25,451 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:56:25,451 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:56:25,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:56:25,451 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:56:25,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:56:25,451 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:56:25,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:56:25,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:56:25,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:56:25,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:56:25,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:56:25,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:56:25,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:56:25,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:56:25,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:56:25,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:56:25,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:56:25,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:56:25,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:56:25,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:56:25,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:56:25,455 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e [2024-10-13 11:56:25,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:56:25,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:56:25,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:56:25,674 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:56:25,675 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:56:25,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i [2024-10-13 11:56:26,906 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:56:27,174 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:56:27,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i [2024-10-13 11:56:27,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b026436d/96215a22f4044593b6445f9b09d06c62/FLAG5d1030dd4 [2024-10-13 11:56:27,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b026436d/96215a22f4044593b6445f9b09d06c62 [2024-10-13 11:56:27,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:56:27,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:56:27,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:56:27,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:56:27,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:56:27,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:56:27" (1/1) ... [2024-10-13 11:56:27,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c96493e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:27, skipping insertion in model container [2024-10-13 11:56:27,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:56:27" (1/1) ... [2024-10-13 11:56:27,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:56:27,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:56:27,806 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-13 11:56:27,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2aea3e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:27, skipping insertion in model container [2024-10-13 11:56:27,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:56:27,808 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:56:27,810 INFO L158 Benchmark]: Toolchain (without parser) took 600.28ms. Allocated memory is still 140.5MB. Free memory was 84.7MB in the beginning and 51.5MB in the end (delta: 33.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-13 11:56:27,810 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 140.5MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:56:27,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.32ms. Allocated memory is still 140.5MB. Free memory was 84.4MB in the beginning and 51.5MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-13 11:56:27,811 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.14ms. Allocated memory is still 140.5MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.32ms. Allocated memory is still 140.5MB. Free memory was 84.4MB in the beginning and 51.5MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:56:29,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:56:29,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 11:56:29,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:56:29,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:56:29,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:56:29,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:56:29,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:56:29,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:56:29,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:56:29,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:56:29,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:56:29,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:56:29,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:56:29,446 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:56:29,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:56:29,447 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:56:29,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:56:29,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:56:29,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:56:29,448 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:56:29,451 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:56:29,451 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:56:29,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:56:29,451 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:56:29,451 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:56:29,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:56:29,451 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:56:29,451 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:56:29,452 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:56:29,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:56:29,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:56:29,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:56:29,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:56:29,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:56:29,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:56:29,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:56:29,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:56:29,454 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:56:29,454 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:56:29,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:56:29,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:56:29,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:56:29,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:56:29,455 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:56:29,455 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e [2024-10-13 11:56:29,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:56:29,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:56:29,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:56:29,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:56:29,715 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:56:29,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i [2024-10-13 11:56:30,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:56:31,218 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:56:31,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i [2024-10-13 11:56:31,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7d96d0b/664f9b4bd82244518c20f7c5c7c33ad2/FLAGdc89fde21 [2024-10-13 11:56:31,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7d96d0b/664f9b4bd82244518c20f7c5c7c33ad2 [2024-10-13 11:56:31,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:56:31,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:56:31,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:56:31,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:56:31,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:56:31,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:56:31" (1/1) ... [2024-10-13 11:56:31,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe2d239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:31, skipping insertion in model container [2024-10-13 11:56:31,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:56:31" (1/1) ... [2024-10-13 11:56:31,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:56:31,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:56:31,818 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:56:31,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:56:31,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:56:31,964 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:56:32,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:56:32,108 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:56:32,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32 WrapperNode [2024-10-13 11:56:32,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:56:32,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:56:32,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:56:32,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:56:32,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32" (1/1) ... [2024-10-13 11:56:32,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32" (1/1) ... [2024-10-13 11:56:32,261 INFO L138 Inliner]: procedures = 180, calls = 606, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2586 [2024-10-13 11:56:32,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:56:32,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:56:32,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:56:32,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:56:32,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32" (1/1) ... [2024-10-13 11:56:32,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32" (1/1) ... [2024-10-13 11:56:32,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32" (1/1) ... [2024-10-13 11:56:32,425 INFO L175 MemorySlicer]: Split 574 memory accesses to 3 slices as follows [2, 466, 106]. 81 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 102 writes are split as follows [0, 98, 4]. [2024-10-13 11:56:32,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32" (1/1) ... [2024-10-13 11:56:32,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32" (1/1) ... [2024-10-13 11:56:32,498 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32" (1/1) ... [2024-10-13 11:56:32,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32" (1/1) ... [2024-10-13 11:56:32,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32" (1/1) ... [2024-10-13 11:56:32,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32" (1/1) ... [2024-10-13 11:56:32,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:56:32,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:56:32,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:56:32,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:56:32,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32" (1/1) ... [2024-10-13 11:56:32,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:56:32,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:56:32,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 11:56:32,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 11:56:32,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:56:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:56:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 11:56:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-13 11:56:32,628 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-13 11:56:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:56:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:56:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 11:56:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 11:56:32,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 11:56:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 11:56:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 11:56:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 11:56:32,630 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 11:56:32,630 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 11:56:32,630 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 11:56:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:56:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:56:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:56:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:56:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:56:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:56:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:56:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:56:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:56:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:56:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:56:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:56:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 11:56:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:56:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:56:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 11:56:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:56:32,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:56:32,863 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:56:32,865 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:56:32,916 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:56:32,954 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:56:32,971 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:56:38,262 INFO L? ?]: Removed 2434 outVars from TransFormulas that were not future-live. [2024-10-13 11:56:38,263 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:56:38,461 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:56:38,462 INFO L314 CfgBuilder]: Removed 168 assume(true) statements. [2024-10-13 11:56:38,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:56:38 BoogieIcfgContainer [2024-10-13 11:56:38,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:56:38,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:56:38,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:56:38,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:56:38,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:56:31" (1/3) ... [2024-10-13 11:56:38,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c22dfc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:56:38, skipping insertion in model container [2024-10-13 11:56:38,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:32" (2/3) ... [2024-10-13 11:56:38,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c22dfc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:56:38, skipping insertion in model container [2024-10-13 11:56:38,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:56:38" (3/3) ... [2024-10-13 11:56:38,471 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test10-3.i [2024-10-13 11:56:38,482 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:56:38,483 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1189 error locations. [2024-10-13 11:56:38,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:56:38,554 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;@47e188b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:56:38,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1189 error locations. [2024-10-13 11:56:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 2225 states, 1024 states have (on average 2.47265625) internal successors, (2532), 2211 states have internal predecessors, (2532), 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-13 11:56:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:56:38,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:56:38,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:56:38,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:56:38,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:56:38,572 INFO L85 PathProgramCache]: Analyzing trace with hash 128244, now seen corresponding path program 1 times [2024-10-13 11:56:38,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:56:38,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426167913] [2024-10-13 11:56:38,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:56:38,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-13 11:56:38,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:56:38,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:56:38,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 11:56:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:56:38,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:56:38,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:56:38,846 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-13 11:56:38,861 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-13 11:56:38,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:56:38,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:56:38,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426167913] [2024-10-13 11:56:38,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426167913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:56:38,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:56:38,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:56:38,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835261811] [2024-10-13 11:56:38,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:56:38,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:56:38,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:56:38,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:56:38,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:56:38,896 INFO L87 Difference]: Start difference. First operand has 2225 states, 1024 states have (on average 2.47265625) internal successors, (2532), 2211 states have internal predecessors, (2532), 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-13 11:56:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:56:41,774 INFO L93 Difference]: Finished difference Result 2980 states and 3180 transitions. [2024-10-13 11:56:41,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:56:41,776 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-13 11:56:41,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:56:41,797 INFO L225 Difference]: With dead ends: 2980 [2024-10-13 11:56:41,797 INFO L226 Difference]: Without dead ends: 2979 [2024-10-13 11:56:41,799 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-13 11:56:41,802 INFO L432 NwaCegarLoop]: 1397 mSDtfsCounter, 2109 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2119 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:56:41,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2119 Valid, 1868 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 11:56:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2024-10-13 11:56:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2334. [2024-10-13 11:56:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 1161 states have (on average 2.2764857881136953) internal successors, (2643), 2318 states have internal predecessors, (2643), 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-13 11:56:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 2675 transitions. [2024-10-13 11:56:41,895 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 2675 transitions. Word has length 2 [2024-10-13 11:56:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:56:41,895 INFO L471 AbstractCegarLoop]: Abstraction has 2334 states and 2675 transitions. [2024-10-13 11:56:41,895 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-13 11:56:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 2675 transitions. [2024-10-13 11:56:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:56:41,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:56:41,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:56:41,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 11:56:42,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:56:42,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:56:42,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:56:42,098 INFO L85 PathProgramCache]: Analyzing trace with hash 128245, now seen corresponding path program 1 times [2024-10-13 11:56:42,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:56:42,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613634853] [2024-10-13 11:56:42,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:56:42,099 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-13 11:56:42,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:56:42,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:56:42,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 11:56:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:56:42,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:56:42,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:56:42,242 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-13 11:56:42,256 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-13 11:56:42,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:56:42,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:56:42,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613634853] [2024-10-13 11:56:42,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613634853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:56:42,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:56:42,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:56:42,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998060467] [2024-10-13 11:56:42,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:56:42,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:56:42,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:56:42,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:56:42,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:56:42,259 INFO L87 Difference]: Start difference. First operand 2334 states and 2675 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-13 11:56:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:56:45,660 INFO L93 Difference]: Finished difference Result 3059 states and 3480 transitions. [2024-10-13 11:56:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:56:45,661 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-13 11:56:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:56:45,668 INFO L225 Difference]: With dead ends: 3059 [2024-10-13 11:56:45,668 INFO L226 Difference]: Without dead ends: 3059 [2024-10-13 11:56:45,669 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-13 11:56:45,670 INFO L432 NwaCegarLoop]: 1841 mSDtfsCounter, 799 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:56:45,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 3016 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 11:56:45,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2024-10-13 11:56:45,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2731. [2024-10-13 11:56:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2731 states, 1556 states have (on average 2.2120822622107967) internal successors, (3442), 2712 states have internal predecessors, (3442), 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-13 11:56:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 3480 transitions. [2024-10-13 11:56:45,710 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 3480 transitions. Word has length 2 [2024-10-13 11:56:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:56:45,710 INFO L471 AbstractCegarLoop]: Abstraction has 2731 states and 3480 transitions. [2024-10-13 11:56:45,711 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-13 11:56:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3480 transitions. [2024-10-13 11:56:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:56:45,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:56:45,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:56:45,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 11:56:45,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:56:45,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:56:45,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:56:45,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1822003394, now seen corresponding path program 1 times [2024-10-13 11:56:45,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:56:45,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30497343] [2024-10-13 11:56:45,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:56:45,913 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-13 11:56:45,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:56:45,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:56:45,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 11:56:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:56:46,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:56:46,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:56:46,068 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-13 11:56:46,074 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-13 11:56:46,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:56:46,129 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-13 11:56:46,142 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:56:46,143 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-13 11:56:46,165 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-13 11:56:46,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:56:46,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:56:46,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30497343] [2024-10-13 11:56:46,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30497343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:56:46,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:56:46,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:56:46,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118414582] [2024-10-13 11:56:46,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:56:46,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:56:46,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:56:46,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:56:46,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:56:46,167 INFO L87 Difference]: Start difference. First operand 2731 states and 3480 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-13 11:56:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:56:52,362 INFO L93 Difference]: Finished difference Result 4773 states and 5672 transitions. [2024-10-13 11:56:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:56:52,364 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-13 11:56:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:56:52,375 INFO L225 Difference]: With dead ends: 4773 [2024-10-13 11:56:52,376 INFO L226 Difference]: Without dead ends: 4773 [2024-10-13 11:56:52,376 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-13 11:56:52,379 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 2161 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 4353 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 4378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:56:52,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2678 Invalid, 4378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4353 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-13 11:56:52,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4773 states. [2024-10-13 11:56:52,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4773 to 3305. [2024-10-13 11:56:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 2130 states have (on average 2.2544600938967134) internal successors, (4802), 3280 states have internal predecessors, (4802), 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-13 11:56:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4852 transitions. [2024-10-13 11:56:52,446 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4852 transitions. Word has length 6 [2024-10-13 11:56:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:56:52,447 INFO L471 AbstractCegarLoop]: Abstraction has 3305 states and 4852 transitions. [2024-10-13 11:56:52,448 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-13 11:56:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4852 transitions. [2024-10-13 11:56:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:56:52,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:56:52,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:56:52,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 11:56:52,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:56:52,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:56:52,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:56:52,650 INFO L85 PathProgramCache]: Analyzing trace with hash -647530346, now seen corresponding path program 1 times [2024-10-13 11:56:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:56:52,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56820042] [2024-10-13 11:56:52,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:56:52,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:56:52,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:56:52,653 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:56:52,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 11:56:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:56:52,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:56:52,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:56:52,801 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-13 11:56:52,810 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-13 11:56:52,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:56:52,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:56:52,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56820042] [2024-10-13 11:56:52,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56820042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:56:52,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:56:52,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:56:52,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749092338] [2024-10-13 11:56:52,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:56:52,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:56:52,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:56:52,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:56:52,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:56:52,812 INFO L87 Difference]: Start difference. First operand 3305 states and 4852 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-13 11:56:55,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:56:55,181 INFO L93 Difference]: Finished difference Result 3941 states and 5446 transitions. [2024-10-13 11:56:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:56:55,182 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-13 11:56:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:56:55,191 INFO L225 Difference]: With dead ends: 3941 [2024-10-13 11:56:55,191 INFO L226 Difference]: Without dead ends: 3941 [2024-10-13 11:56:55,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-13 11:56:55,193 INFO L432 NwaCegarLoop]: 1997 mSDtfsCounter, 1726 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:56:55,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 2652 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 11:56:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2024-10-13 11:56:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3213. [2024-10-13 11:56:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3213 states, 2130 states have (on average 2.1535211267605634) internal successors, (4587), 3188 states have internal predecessors, (4587), 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-13 11:56:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3213 states to 3213 states and 4637 transitions. [2024-10-13 11:56:55,239 INFO L78 Accepts]: Start accepts. Automaton has 3213 states and 4637 transitions. Word has length 7 [2024-10-13 11:56:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:56:55,239 INFO L471 AbstractCegarLoop]: Abstraction has 3213 states and 4637 transitions. [2024-10-13 11:56:55,239 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-13 11:56:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 4637 transitions. [2024-10-13 11:56:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:56:55,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:56:55,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:56:55,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 11:56:55,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:56:55,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:56:55,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:56:55,442 INFO L85 PathProgramCache]: Analyzing trace with hash -647530345, now seen corresponding path program 1 times [2024-10-13 11:56:55,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:56:55,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464662767] [2024-10-13 11:56:55,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:56:55,442 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-13 11:56:55,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:56:55,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:56:55,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 11:56:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:56:55,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:56:55,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:56:55,577 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-13 11:56:55,598 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-13 11:56:55,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:56:55,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:56:55,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464662767] [2024-10-13 11:56:55,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464662767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:56:55,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:56:55,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:56:55,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869570786] [2024-10-13 11:56:55,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:56:55,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:56:55,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:56:55,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:56:55,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:56:55,602 INFO L87 Difference]: Start difference. First operand 3213 states and 4637 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-13 11:56:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:56:58,935 INFO L93 Difference]: Finished difference Result 4782 states and 6861 transitions. [2024-10-13 11:56:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:56:58,936 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-13 11:56:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:56:58,947 INFO L225 Difference]: With dead ends: 4782 [2024-10-13 11:56:58,947 INFO L226 Difference]: Without dead ends: 4782 [2024-10-13 11:56:58,948 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-13 11:56:58,948 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 1285 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1848 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 3289 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:56:58,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 3289 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1848 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 11:56:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2024-10-13 11:56:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 3481. [2024-10-13 11:56:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3481 states, 2408 states have (on average 2.1391196013289036) internal successors, (5151), 3456 states have internal predecessors, (5151), 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-13 11:56:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 5201 transitions. [2024-10-13 11:56:58,996 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 5201 transitions. Word has length 7 [2024-10-13 11:56:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:56:58,996 INFO L471 AbstractCegarLoop]: Abstraction has 3481 states and 5201 transitions. [2024-10-13 11:56:58,996 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-13 11:56:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 5201 transitions. [2024-10-13 11:56:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 11:56:58,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:56:58,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:56:59,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 11:56:59,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:56:59,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:56:59,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:56:59,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1113558595, now seen corresponding path program 1 times [2024-10-13 11:56:59,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:56:59,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381853553] [2024-10-13 11:56:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:56:59,201 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-13 11:56:59,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:56:59,202 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:56:59,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 11:56:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:56:59,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:56:59,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:56:59,346 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-13 11:56:59,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:56:59,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:56:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381853553] [2024-10-13 11:56:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381853553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:56:59,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:56:59,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:56:59,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785023603] [2024-10-13 11:56:59,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:56:59,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:56:59,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:56:59,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:56:59,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:56:59,348 INFO L87 Difference]: Start difference. First operand 3481 states and 5201 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-13 11:57:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:00,218 INFO L93 Difference]: Finished difference Result 3427 states and 5121 transitions. [2024-10-13 11:57:00,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:57:00,219 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-13 11:57:00,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:00,226 INFO L225 Difference]: With dead ends: 3427 [2024-10-13 11:57:00,226 INFO L226 Difference]: Without dead ends: 3427 [2024-10-13 11:57:00,226 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-13 11:57:00,227 INFO L432 NwaCegarLoop]: 1963 mSDtfsCounter, 61 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:00,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3884 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 11:57:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3427 states. [2024-10-13 11:57:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3427 to 3427. [2024-10-13 11:57:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3427 states, 2378 states have (on average 2.1324642556770397) internal successors, (5071), 3402 states have internal predecessors, (5071), 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-13 11:57:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 5121 transitions. [2024-10-13 11:57:00,259 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 5121 transitions. Word has length 10 [2024-10-13 11:57:00,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:00,259 INFO L471 AbstractCegarLoop]: Abstraction has 3427 states and 5121 transitions. [2024-10-13 11:57:00,259 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-13 11:57:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 5121 transitions. [2024-10-13 11:57:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:57:00,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:00,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:57:00,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 11:57:00,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:00,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:00,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:00,461 INFO L85 PathProgramCache]: Analyzing trace with hash 683006685, now seen corresponding path program 1 times [2024-10-13 11:57:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:00,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596633140] [2024-10-13 11:57:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:00,462 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-13 11:57:00,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:00,463 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:00,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 11:57:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:00,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:57:00,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:00,607 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-13 11:57:00,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:00,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:00,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596633140] [2024-10-13 11:57:00,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596633140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:00,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:00,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:00,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416845290] [2024-10-13 11:57:00,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:00,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:00,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:00,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:00,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:00,611 INFO L87 Difference]: Start difference. First operand 3427 states and 5121 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-13 11:57:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:01,678 INFO L93 Difference]: Finished difference Result 3411 states and 5077 transitions. [2024-10-13 11:57:01,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:57:01,679 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-13 11:57:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:01,688 INFO L225 Difference]: With dead ends: 3411 [2024-10-13 11:57:01,688 INFO L226 Difference]: Without dead ends: 3411 [2024-10-13 11:57:01,688 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-13 11:57:01,689 INFO L432 NwaCegarLoop]: 1932 mSDtfsCounter, 45 mSDsluCounter, 3846 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5778 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:01,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5778 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 11:57:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3411 states. [2024-10-13 11:57:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3411 to 3411. [2024-10-13 11:57:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3411 states, 2376 states have (on average 2.115740740740741) internal successors, (5027), 3386 states have internal predecessors, (5027), 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-13 11:57:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 5077 transitions. [2024-10-13 11:57:01,721 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 5077 transitions. Word has length 12 [2024-10-13 11:57:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:01,721 INFO L471 AbstractCegarLoop]: Abstraction has 3411 states and 5077 transitions. [2024-10-13 11:57:01,722 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-13 11:57:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 5077 transitions. [2024-10-13 11:57:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 11:57:01,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:01,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:57:01,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:01,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:01,923 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:01,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:01,923 INFO L85 PathProgramCache]: Analyzing trace with hash 976598510, now seen corresponding path program 1 times [2024-10-13 11:57:01,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:01,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542443527] [2024-10-13 11:57:01,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:01,924 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-13 11:57:01,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:01,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:01,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 11:57:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:02,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:57:02,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:02,083 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-13 11:57:02,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:02,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:02,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542443527] [2024-10-13 11:57:02,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542443527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:02,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:02,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:57:02,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057483681] [2024-10-13 11:57:02,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:02,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:57:02,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:02,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:57:02,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:57:02,085 INFO L87 Difference]: Start difference. First operand 3411 states and 5077 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-13 11:57:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:02,883 INFO L93 Difference]: Finished difference Result 3297 states and 4837 transitions. [2024-10-13 11:57:02,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:57:02,884 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-13 11:57:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:02,889 INFO L225 Difference]: With dead ends: 3297 [2024-10-13 11:57:02,889 INFO L226 Difference]: Without dead ends: 3297 [2024-10-13 11:57:02,889 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-13 11:57:02,890 INFO L432 NwaCegarLoop]: 1905 mSDtfsCounter, 61 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:02,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3768 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 11:57:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2024-10-13 11:57:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 3297. [2024-10-13 11:57:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3297 states, 2286 states have (on average 2.094050743657043) internal successors, (4787), 3272 states have internal predecessors, (4787), 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-13 11:57:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 4837 transitions. [2024-10-13 11:57:02,928 INFO L78 Accepts]: Start accepts. Automaton has 3297 states and 4837 transitions. Word has length 17 [2024-10-13 11:57:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:02,928 INFO L471 AbstractCegarLoop]: Abstraction has 3297 states and 4837 transitions. [2024-10-13 11:57:02,928 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-13 11:57:02,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 4837 transitions. [2024-10-13 11:57:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 11:57:02,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:02,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:57:02,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 11:57:03,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:03,130 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:03,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:03,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1245463214, now seen corresponding path program 1 times [2024-10-13 11:57:03,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:03,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556654030] [2024-10-13 11:57:03,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:03,131 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-13 11:57:03,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:03,134 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:03,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 11:57:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:03,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:57:03,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:03,314 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-13 11:57:03,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:03,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:03,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556654030] [2024-10-13 11:57:03,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556654030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:03,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:03,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:57:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298907065] [2024-10-13 11:57:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:03,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:57:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:03,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:57:03,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:57:03,316 INFO L87 Difference]: Start difference. First operand 3297 states and 4837 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-13 11:57:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:04,076 INFO L93 Difference]: Finished difference Result 3243 states and 4757 transitions. [2024-10-13 11:57:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:57:04,077 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-13 11:57:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:04,082 INFO L225 Difference]: With dead ends: 3243 [2024-10-13 11:57:04,082 INFO L226 Difference]: Without dead ends: 3243 [2024-10-13 11:57:04,082 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-13 11:57:04,082 INFO L432 NwaCegarLoop]: 1868 mSDtfsCounter, 61 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:04,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3694 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:57:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2024-10-13 11:57:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 3243. [2024-10-13 11:57:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3243 states, 2256 states have (on average 2.086436170212766) internal successors, (4707), 3218 states have internal predecessors, (4707), 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-13 11:57:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 4757 transitions. [2024-10-13 11:57:04,119 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 4757 transitions. Word has length 17 [2024-10-13 11:57:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:04,119 INFO L471 AbstractCegarLoop]: Abstraction has 3243 states and 4757 transitions. [2024-10-13 11:57:04,119 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-13 11:57:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 4757 transitions. [2024-10-13 11:57:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 11:57:04,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:04,120 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-13 11:57:04,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:04,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:04,325 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:04,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:04,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2086644088, now seen corresponding path program 1 times [2024-10-13 11:57:04,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:04,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26646199] [2024-10-13 11:57:04,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:04,326 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-13 11:57:04,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:04,328 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:04,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 11:57:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:04,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:57:04,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:04,502 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-13 11:57:04,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:04,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:04,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26646199] [2024-10-13 11:57:04,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26646199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:04,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:04,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:04,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956507713] [2024-10-13 11:57:04,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:04,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:04,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:04,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:04,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:04,504 INFO L87 Difference]: Start difference. First operand 3243 states and 4757 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-13 11:57:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:05,497 INFO L93 Difference]: Finished difference Result 3223 states and 4625 transitions. [2024-10-13 11:57:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:57:05,497 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-13 11:57:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:05,501 INFO L225 Difference]: With dead ends: 3223 [2024-10-13 11:57:05,501 INFO L226 Difference]: Without dead ends: 3223 [2024-10-13 11:57:05,501 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-13 11:57:05,501 INFO L432 NwaCegarLoop]: 1837 mSDtfsCounter, 45 mSDsluCounter, 3656 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5493 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:05,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5493 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 11:57:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2024-10-13 11:57:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 3223. [2024-10-13 11:57:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 2250 states have (on average 2.033333333333333) internal successors, (4575), 3198 states have internal predecessors, (4575), 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-13 11:57:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4625 transitions. [2024-10-13 11:57:05,531 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4625 transitions. Word has length 19 [2024-10-13 11:57:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:05,531 INFO L471 AbstractCegarLoop]: Abstraction has 3223 states and 4625 transitions. [2024-10-13 11:57:05,532 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-13 11:57:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4625 transitions. [2024-10-13 11:57:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 11:57:05,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:05,534 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-13 11:57:05,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 11:57:05,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:05,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:05,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1405728888, now seen corresponding path program 1 times [2024-10-13 11:57:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:05,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029546070] [2024-10-13 11:57:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:05,736 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-13 11:57:05,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:05,737 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:05,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 11:57:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:05,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:57:05,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:05,910 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-13 11:57:05,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:05,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:05,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029546070] [2024-10-13 11:57:05,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029546070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:05,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:05,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:05,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174554526] [2024-10-13 11:57:05,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:05,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:05,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:05,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:05,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:05,911 INFO L87 Difference]: Start difference. First operand 3223 states and 4625 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-13 11:57:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:06,865 INFO L93 Difference]: Finished difference Result 3207 states and 4581 transitions. [2024-10-13 11:57:06,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:57:06,867 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-13 11:57:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:06,871 INFO L225 Difference]: With dead ends: 3207 [2024-10-13 11:57:06,871 INFO L226 Difference]: Without dead ends: 3207 [2024-10-13 11:57:06,871 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-13 11:57:06,872 INFO L432 NwaCegarLoop]: 1816 mSDtfsCounter, 45 mSDsluCounter, 3614 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5430 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:06,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5430 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:57:06,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2024-10-13 11:57:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3207. [2024-10-13 11:57:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 2248 states have (on average 2.0155693950177938) internal successors, (4531), 3182 states have internal predecessors, (4531), 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-13 11:57:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 4581 transitions. [2024-10-13 11:57:06,897 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 4581 transitions. Word has length 19 [2024-10-13 11:57:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:06,897 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 4581 transitions. [2024-10-13 11:57:06,898 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-13 11:57:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 4581 transitions. [2024-10-13 11:57:06,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:57:06,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:06,898 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-13 11:57:06,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:07,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:07,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:07,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:07,103 INFO L85 PathProgramCache]: Analyzing trace with hash 305860875, now seen corresponding path program 1 times [2024-10-13 11:57:07,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:07,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882799864] [2024-10-13 11:57:07,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:07,103 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-13 11:57:07,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:07,104 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:07,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 11:57:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:07,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:57:07,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:07,272 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-13 11:57:07,315 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-13 11:57:07,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:07,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:07,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882799864] [2024-10-13 11:57:07,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882799864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:07,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:07,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:57:07,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627086405] [2024-10-13 11:57:07,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:07,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:07,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:07,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:07,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:07,316 INFO L87 Difference]: Start difference. First operand 3207 states and 4581 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-13 11:57:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:09,996 INFO L93 Difference]: Finished difference Result 3781 states and 5070 transitions. [2024-10-13 11:57:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:09,997 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-13 11:57:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:10,005 INFO L225 Difference]: With dead ends: 3781 [2024-10-13 11:57:10,005 INFO L226 Difference]: Without dead ends: 3781 [2024-10-13 11:57:10,006 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-13 11:57:10,006 INFO L432 NwaCegarLoop]: 1278 mSDtfsCounter, 1829 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:10,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1839 Valid, 2810 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 11:57:10,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3781 states. [2024-10-13 11:57:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3781 to 3203. [2024-10-13 11:57:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3203 states, 2248 states have (on average 2.0120106761565837) internal successors, (4523), 3178 states have internal predecessors, (4523), 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-13 11:57:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3203 states to 3203 states and 4573 transitions. [2024-10-13 11:57:10,035 INFO L78 Accepts]: Start accepts. Automaton has 3203 states and 4573 transitions. Word has length 26 [2024-10-13 11:57:10,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:10,035 INFO L471 AbstractCegarLoop]: Abstraction has 3203 states and 4573 transitions. [2024-10-13 11:57:10,035 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-13 11:57:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3203 states and 4573 transitions. [2024-10-13 11:57:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:57:10,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:10,036 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-13 11:57:10,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 11:57:10,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:10,237 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:10,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:10,237 INFO L85 PathProgramCache]: Analyzing trace with hash 305860876, now seen corresponding path program 1 times [2024-10-13 11:57:10,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:10,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388144880] [2024-10-13 11:57:10,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:10,238 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-13 11:57:10,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:10,240 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:10,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 11:57:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:10,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:57:10,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:10,385 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-13 11:57:10,497 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-13 11:57:10,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:10,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:10,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388144880] [2024-10-13 11:57:10,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388144880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:10,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:10,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:57:10,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8725864] [2024-10-13 11:57:10,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:10,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:10,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:10,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:10,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:10,498 INFO L87 Difference]: Start difference. First operand 3203 states and 4573 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-13 11:57:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:14,004 INFO L93 Difference]: Finished difference Result 3871 states and 5313 transitions. [2024-10-13 11:57:14,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:14,005 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-13 11:57:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:14,009 INFO L225 Difference]: With dead ends: 3871 [2024-10-13 11:57:14,009 INFO L226 Difference]: Without dead ends: 3871 [2024-10-13 11:57:14,009 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-13 11:57:14,009 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 737 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:14,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 3569 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-13 11:57:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2024-10-13 11:57:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3236. [2024-10-13 11:57:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3236 states, 2281 states have (on average 1.9995615957913195) internal successors, (4561), 3211 states have internal predecessors, (4561), 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-13 11:57:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4611 transitions. [2024-10-13 11:57:14,033 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4611 transitions. Word has length 26 [2024-10-13 11:57:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:14,033 INFO L471 AbstractCegarLoop]: Abstraction has 3236 states and 4611 transitions. [2024-10-13 11:57:14,033 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-13 11:57:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4611 transitions. [2024-10-13 11:57:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:57:14,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:14,034 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-13 11:57:14,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 11:57:14,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:14,234 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:14,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash -14165834, now seen corresponding path program 1 times [2024-10-13 11:57:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:14,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793550999] [2024-10-13 11:57:14,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:14,235 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-13 11:57:14,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:14,238 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:14,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 11:57:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:14,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:57:14,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:14,402 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-13 11:57:14,449 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-13 11:57:14,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:14,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:14,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793550999] [2024-10-13 11:57:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793550999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:14,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:14,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:57:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172391693] [2024-10-13 11:57:14,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:14,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:14,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:14,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:14,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:14,450 INFO L87 Difference]: Start difference. First operand 3236 states and 4611 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-13 11:57:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:17,181 INFO L93 Difference]: Finished difference Result 3889 states and 5312 transitions. [2024-10-13 11:57:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:17,182 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-13 11:57:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:17,185 INFO L225 Difference]: With dead ends: 3889 [2024-10-13 11:57:17,185 INFO L226 Difference]: Without dead ends: 3889 [2024-10-13 11:57:17,185 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-13 11:57:17,186 INFO L432 NwaCegarLoop]: 1837 mSDtfsCounter, 1526 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 2882 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 3843 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:17,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 3843 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2882 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 11:57:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3889 states. [2024-10-13 11:57:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3889 to 3232. [2024-10-13 11:57:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3232 states, 2281 states have (on average 1.98903989478299) internal successors, (4537), 3207 states have internal predecessors, (4537), 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-13 11:57:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4587 transitions. [2024-10-13 11:57:17,210 INFO L78 Accepts]: Start accepts. Automaton has 3232 states and 4587 transitions. Word has length 33 [2024-10-13 11:57:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:17,210 INFO L471 AbstractCegarLoop]: Abstraction has 3232 states and 4587 transitions. [2024-10-13 11:57:17,210 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-13 11:57:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4587 transitions. [2024-10-13 11:57:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:57:17,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:17,211 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-13 11:57:17,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 11:57:17,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:17,412 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:17,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:17,412 INFO L85 PathProgramCache]: Analyzing trace with hash -14165833, now seen corresponding path program 1 times [2024-10-13 11:57:17,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:17,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63331013] [2024-10-13 11:57:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:17,412 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-13 11:57:17,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:17,414 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:17,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 11:57:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:17,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:57:17,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:17,590 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-13 11:57:17,713 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-13 11:57:17,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:17,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:17,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63331013] [2024-10-13 11:57:17,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63331013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:17,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:17,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:57:17,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266921930] [2024-10-13 11:57:17,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:17,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:17,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:17,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:17,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:17,714 INFO L87 Difference]: Start difference. First operand 3232 states and 4587 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-13 11:57:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:21,605 INFO L93 Difference]: Finished difference Result 4421 states and 6115 transitions. [2024-10-13 11:57:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:21,606 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-13 11:57:21,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:21,610 INFO L225 Difference]: With dead ends: 4421 [2024-10-13 11:57:21,610 INFO L226 Difference]: Without dead ends: 4421 [2024-10-13 11:57:21,610 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-13 11:57:21,610 INFO L432 NwaCegarLoop]: 2138 mSDtfsCounter, 1081 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 3000 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4487 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:21,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 4487 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3000 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-13 11:57:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2024-10-13 11:57:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3232. [2024-10-13 11:57:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3232 states, 2281 states have (on average 1.9855326611135466) internal successors, (4529), 3207 states have internal predecessors, (4529), 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-13 11:57:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4579 transitions. [2024-10-13 11:57:21,638 INFO L78 Accepts]: Start accepts. Automaton has 3232 states and 4579 transitions. Word has length 33 [2024-10-13 11:57:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:21,639 INFO L471 AbstractCegarLoop]: Abstraction has 3232 states and 4579 transitions. [2024-10-13 11:57:21,639 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-13 11:57:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4579 transitions. [2024-10-13 11:57:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:57:21,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:21,640 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-13 11:57:21,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 11:57:21,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:21,841 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:21,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:21,841 INFO L85 PathProgramCache]: Analyzing trace with hash 10995574, now seen corresponding path program 1 times [2024-10-13 11:57:21,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:21,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465364184] [2024-10-13 11:57:21,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:21,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-13 11:57:21,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:21,845 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:21,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 11:57:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:22,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:57:22,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:22,069 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-13 11:57:22,122 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-13 11:57:22,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:22,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465364184] [2024-10-13 11:57:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465364184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:22,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:22,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:57:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596250282] [2024-10-13 11:57:22,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:22,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:22,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:22,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:22,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:22,125 INFO L87 Difference]: Start difference. First operand 3232 states and 4579 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-13 11:57:24,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:24,877 INFO L93 Difference]: Finished difference Result 3869 states and 5280 transitions. [2024-10-13 11:57:24,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:24,878 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-13 11:57:24,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:24,882 INFO L225 Difference]: With dead ends: 3869 [2024-10-13 11:57:24,893 INFO L226 Difference]: Without dead ends: 3869 [2024-10-13 11:57:24,894 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-13 11:57:24,894 INFO L432 NwaCegarLoop]: 1837 mSDtfsCounter, 1522 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 2874 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 3843 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:24,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 3843 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2874 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 11:57:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2024-10-13 11:57:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 3228. [2024-10-13 11:57:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3228 states, 2281 states have (on average 1.9820254274441034) internal successors, (4521), 3203 states have internal predecessors, (4521), 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-13 11:57:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 3228 states and 4571 transitions. [2024-10-13 11:57:24,918 INFO L78 Accepts]: Start accepts. Automaton has 3228 states and 4571 transitions. Word has length 33 [2024-10-13 11:57:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:24,919 INFO L471 AbstractCegarLoop]: Abstraction has 3228 states and 4571 transitions. [2024-10-13 11:57:24,919 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-13 11:57:24,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3228 states and 4571 transitions. [2024-10-13 11:57:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:57:24,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:24,919 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-13 11:57:24,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:25,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:25,124 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:25,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash 10995575, now seen corresponding path program 1 times [2024-10-13 11:57:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:25,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991712703] [2024-10-13 11:57:25,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:25,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:25,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:25,127 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:25,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 11:57:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:25,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:57:25,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:25,319 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-13 11:57:25,418 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-13 11:57:25,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:25,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:25,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991712703] [2024-10-13 11:57:25,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991712703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:25,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:25,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:57:25,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12017754] [2024-10-13 11:57:25,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:25,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:25,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:25,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:25,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:25,419 INFO L87 Difference]: Start difference. First operand 3228 states and 4571 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-13 11:57:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:29,290 INFO L93 Difference]: Finished difference Result 4413 states and 6099 transitions. [2024-10-13 11:57:29,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:29,290 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-13 11:57:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:29,294 INFO L225 Difference]: With dead ends: 4413 [2024-10-13 11:57:29,294 INFO L226 Difference]: Without dead ends: 4413 [2024-10-13 11:57:29,294 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-13 11:57:29,295 INFO L432 NwaCegarLoop]: 2134 mSDtfsCounter, 1073 mSDsluCounter, 2318 mSDsCounter, 0 mSdLazyCounter, 2988 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 4452 SdHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:29,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 4452 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2988 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-13 11:57:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2024-10-13 11:57:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 3224. [2024-10-13 11:57:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3224 states, 2281 states have (on average 1.9785181937746603) internal successors, (4513), 3199 states have internal predecessors, (4513), 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-13 11:57:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3224 states to 3224 states and 4563 transitions. [2024-10-13 11:57:29,319 INFO L78 Accepts]: Start accepts. Automaton has 3224 states and 4563 transitions. Word has length 33 [2024-10-13 11:57:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:29,319 INFO L471 AbstractCegarLoop]: Abstraction has 3224 states and 4563 transitions. [2024-10-13 11:57:29,319 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-13 11:57:29,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 4563 transitions. [2024-10-13 11:57:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 11:57:29,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:29,320 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-13 11:57:29,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:29,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:29,520 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:29,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:29,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1287196731, now seen corresponding path program 1 times [2024-10-13 11:57:29,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:29,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746459439] [2024-10-13 11:57:29,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:29,521 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-13 11:57:29,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:29,523 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:29,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 11:57:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:29,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:57:29,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:29,704 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-13 11:57:29,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:29,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:29,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746459439] [2024-10-13 11:57:29,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746459439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:29,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:29,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:29,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425050878] [2024-10-13 11:57:29,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:29,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:29,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:29,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:29,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:29,705 INFO L87 Difference]: Start difference. First operand 3224 states and 4563 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-13 11:57:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:30,716 INFO L93 Difference]: Finished difference Result 3212 states and 4539 transitions. [2024-10-13 11:57:30,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:57:30,717 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-13 11:57:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:30,719 INFO L225 Difference]: With dead ends: 3212 [2024-10-13 11:57:30,719 INFO L226 Difference]: Without dead ends: 3212 [2024-10-13 11:57:30,719 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-13 11:57:30,720 INFO L432 NwaCegarLoop]: 1802 mSDtfsCounter, 21 mSDsluCounter, 3581 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5383 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:30,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5383 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 11:57:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2024-10-13 11:57:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 3212. [2024-10-13 11:57:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2269 states have (on average 1.978404583516968) internal successors, (4489), 3187 states have internal predecessors, (4489), 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-13 11:57:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 4539 transitions. [2024-10-13 11:57:30,743 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 4539 transitions. Word has length 40 [2024-10-13 11:57:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:30,743 INFO L471 AbstractCegarLoop]: Abstraction has 3212 states and 4539 transitions. [2024-10-13 11:57:30,743 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-13 11:57:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 4539 transitions. [2024-10-13 11:57:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 11:57:30,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:30,744 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-13 11:57:30,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-13 11:57:30,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:30,945 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:30,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:30,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1543497534, now seen corresponding path program 1 times [2024-10-13 11:57:30,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:30,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104413474] [2024-10-13 11:57:30,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:30,946 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-13 11:57:30,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:30,948 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:30,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-13 11:57:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:31,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:57:31,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:31,252 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-13 11:57:31,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:31,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:31,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104413474] [2024-10-13 11:57:31,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104413474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:31,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:31,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:57:31,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497871916] [2024-10-13 11:57:31,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:31,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:57:31,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:31,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:57:31,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:57:31,254 INFO L87 Difference]: Start difference. First operand 3212 states and 4539 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-13 11:57:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:32,324 INFO L93 Difference]: Finished difference Result 4838 states and 6580 transitions. [2024-10-13 11:57:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:57:32,324 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-13 11:57:32,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:32,329 INFO L225 Difference]: With dead ends: 4838 [2024-10-13 11:57:32,329 INFO L226 Difference]: Without dead ends: 4838 [2024-10-13 11:57:32,329 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-13 11:57:32,330 INFO L432 NwaCegarLoop]: 1869 mSDtfsCounter, 1348 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 3588 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:32,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 3588 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 11:57:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4838 states. [2024-10-13 11:57:32,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4838 to 4093. [2024-10-13 11:57:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4093 states, 3143 states have (on average 1.958001909004136) internal successors, (6154), 4058 states have internal predecessors, (6154), 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-13 11:57:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 6224 transitions. [2024-10-13 11:57:32,383 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 6224 transitions. Word has length 44 [2024-10-13 11:57:32,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:32,383 INFO L471 AbstractCegarLoop]: Abstraction has 4093 states and 6224 transitions. [2024-10-13 11:57:32,383 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-13 11:57:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 6224 transitions. [2024-10-13 11:57:32,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 11:57:32,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:32,384 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-13 11:57:32,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:32,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:32,584 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:32,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:32,585 INFO L85 PathProgramCache]: Analyzing trace with hash 504267824, now seen corresponding path program 1 times [2024-10-13 11:57:32,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:32,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083725985] [2024-10-13 11:57:32,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:32,585 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-13 11:57:32,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:32,587 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:32,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-13 11:57:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:32,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:57:32,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:32,817 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-13 11:57:32,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:32,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:32,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083725985] [2024-10-13 11:57:32,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083725985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:32,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:32,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:32,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700569784] [2024-10-13 11:57:32,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:32,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:32,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:32,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:32,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:32,819 INFO L87 Difference]: Start difference. First operand 4093 states and 6224 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-13 11:57:33,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:33,787 INFO L93 Difference]: Finished difference Result 4051 states and 6154 transitions. [2024-10-13 11:57:33,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:57:33,788 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-13 11:57:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:33,792 INFO L225 Difference]: With dead ends: 4051 [2024-10-13 11:57:33,792 INFO L226 Difference]: Without dead ends: 4051 [2024-10-13 11:57:33,792 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-13 11:57:33,792 INFO L432 NwaCegarLoop]: 1798 mSDtfsCounter, 21 mSDsluCounter, 3573 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5371 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:33,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5371 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:57:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2024-10-13 11:57:33,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 4051. [2024-10-13 11:57:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4051 states, 3101 states have (on average 1.9619477587874878) internal successors, (6084), 4016 states have internal predecessors, (6084), 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-13 11:57:33,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4051 states to 4051 states and 6154 transitions. [2024-10-13 11:57:33,821 INFO L78 Accepts]: Start accepts. Automaton has 4051 states and 6154 transitions. Word has length 49 [2024-10-13 11:57:33,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:33,821 INFO L471 AbstractCegarLoop]: Abstraction has 4051 states and 6154 transitions. [2024-10-13 11:57:33,821 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-13 11:57:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4051 states and 6154 transitions. [2024-10-13 11:57:33,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 11:57:33,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:33,822 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-13 11:57:33,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-13 11:57:34,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:34,023 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:34,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:34,023 INFO L85 PathProgramCache]: Analyzing trace with hash -243153397, now seen corresponding path program 1 times [2024-10-13 11:57:34,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:34,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633855149] [2024-10-13 11:57:34,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:34,024 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-13 11:57:34,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:34,026 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:34,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-13 11:57:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:34,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:57:34,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:34,250 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-13 11:57:34,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:34,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:34,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633855149] [2024-10-13 11:57:34,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633855149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:34,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:34,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:34,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251224262] [2024-10-13 11:57:34,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:34,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:34,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:34,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:34,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:34,252 INFO L87 Difference]: Start difference. First operand 4051 states and 6154 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-13 11:57:35,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:35,223 INFO L93 Difference]: Finished difference Result 4033 states and 6124 transitions. [2024-10-13 11:57:35,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:57:35,223 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-13 11:57:35,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:35,227 INFO L225 Difference]: With dead ends: 4033 [2024-10-13 11:57:35,227 INFO L226 Difference]: Without dead ends: 4033 [2024-10-13 11:57:35,227 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-13 11:57:35,228 INFO L432 NwaCegarLoop]: 1794 mSDtfsCounter, 15 mSDsluCounter, 3571 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5365 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:35,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5365 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:57:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2024-10-13 11:57:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 4033. [2024-10-13 11:57:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4033 states, 3083 states have (on average 1.963671748297113) internal successors, (6054), 3998 states have internal predecessors, (6054), 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-13 11:57:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 6124 transitions. [2024-10-13 11:57:35,255 INFO L78 Accepts]: Start accepts. Automaton has 4033 states and 6124 transitions. Word has length 52 [2024-10-13 11:57:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:35,256 INFO L471 AbstractCegarLoop]: Abstraction has 4033 states and 6124 transitions. [2024-10-13 11:57:35,256 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-13 11:57:35,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4033 states and 6124 transitions. [2024-10-13 11:57:35,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 11:57:35,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:35,257 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-13 11:57:35,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-13 11:57:35,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:35,457 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:35,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:35,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1394404120, now seen corresponding path program 1 times [2024-10-13 11:57:35,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:35,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733676621] [2024-10-13 11:57:35,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:35,458 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-13 11:57:35,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:35,459 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:35,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-13 11:57:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:35,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:57:35,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:35,673 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:57:35,674 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:57:35,677 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-13 11:57:35,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:57:35,697 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-13 11:57:35,721 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-13 11:57:35,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:35,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:35,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733676621] [2024-10-13 11:57:35,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733676621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:35,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:35,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:35,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358508744] [2024-10-13 11:57:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:35,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:35,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:35,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:35,724 INFO L87 Difference]: Start difference. First operand 4033 states and 6124 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-13 11:57:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:37,817 INFO L93 Difference]: Finished difference Result 5285 states and 7933 transitions. [2024-10-13 11:57:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:37,818 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-13 11:57:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:37,823 INFO L225 Difference]: With dead ends: 5285 [2024-10-13 11:57:37,823 INFO L226 Difference]: Without dead ends: 5285 [2024-10-13 11:57:37,823 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-13 11:57:37,824 INFO L432 NwaCegarLoop]: 1924 mSDtfsCounter, 1535 mSDsluCounter, 3041 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:37,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 4965 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 11:57:37,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5285 states. [2024-10-13 11:57:37,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5285 to 4002. [2024-10-13 11:57:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4002 states, 3052 states have (on average 1.973132372214941) internal successors, (6022), 3967 states have internal predecessors, (6022), 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-13 11:57:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4002 states to 4002 states and 6092 transitions. [2024-10-13 11:57:37,850 INFO L78 Accepts]: Start accepts. Automaton has 4002 states and 6092 transitions. Word has length 55 [2024-10-13 11:57:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:37,850 INFO L471 AbstractCegarLoop]: Abstraction has 4002 states and 6092 transitions. [2024-10-13 11:57:37,850 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-13 11:57:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 4002 states and 6092 transitions. [2024-10-13 11:57:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 11:57:37,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:37,851 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-13 11:57:37,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-10-13 11:57:38,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:38,051 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:38,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1259177938, now seen corresponding path program 1 times [2024-10-13 11:57:38,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:38,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278657830] [2024-10-13 11:57:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:38,052 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-13 11:57:38,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:38,053 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:38,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-13 11:57:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:38,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:57:38,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:38,395 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-13 11:57:38,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:38,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:38,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278657830] [2024-10-13 11:57:38,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278657830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:38,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:38,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:57:38,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487971186] [2024-10-13 11:57:38,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:38,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:57:38,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:38,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:57:38,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:57:38,396 INFO L87 Difference]: Start difference. First operand 4002 states and 6092 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-13 11:57:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:39,336 INFO L93 Difference]: Finished difference Result 5618 states and 8183 transitions. [2024-10-13 11:57:39,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:57:39,336 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-13 11:57:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:39,341 INFO L225 Difference]: With dead ends: 5618 [2024-10-13 11:57:39,341 INFO L226 Difference]: Without dead ends: 5618 [2024-10-13 11:57:39,342 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-13 11:57:39,355 INFO L432 NwaCegarLoop]: 2026 mSDtfsCounter, 1087 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 3775 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:39,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 3775 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:57:39,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5618 states. [2024-10-13 11:57:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5618 to 4923. [2024-10-13 11:57:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4923 states, 3965 states have (on average 1.9414880201765448) internal successors, (7698), 4877 states have internal predecessors, (7698), 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-13 11:57:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4923 states to 4923 states and 7790 transitions. [2024-10-13 11:57:39,385 INFO L78 Accepts]: Start accepts. Automaton has 4923 states and 7790 transitions. Word has length 53 [2024-10-13 11:57:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:39,386 INFO L471 AbstractCegarLoop]: Abstraction has 4923 states and 7790 transitions. [2024-10-13 11:57:39,386 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-13 11:57:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4923 states and 7790 transitions. [2024-10-13 11:57:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 11:57:39,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:39,386 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-13 11:57:39,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:39,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:39,587 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:39,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:39,587 INFO L85 PathProgramCache]: Analyzing trace with hash -180969593, now seen corresponding path program 1 times [2024-10-13 11:57:39,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:39,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684246838] [2024-10-13 11:57:39,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:39,588 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-13 11:57:39,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:39,590 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:39,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-13 11:57:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:39,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:57:39,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:39,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:57:39,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:57:39,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:57:39,876 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-13 11:57:39,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:57:39,971 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-13 11:57:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:57:39,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:39,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:39,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684246838] [2024-10-13 11:57:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684246838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:39,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:39,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:39,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584945582] [2024-10-13 11:57:39,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:39,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:39,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:39,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:39,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:39,981 INFO L87 Difference]: Start difference. First operand 4923 states and 7790 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-13 11:57:41,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:41,454 INFO L93 Difference]: Finished difference Result 5240 states and 7869 transitions. [2024-10-13 11:57:41,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:41,455 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-13 11:57:41,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:41,460 INFO L225 Difference]: With dead ends: 5240 [2024-10-13 11:57:41,460 INFO L226 Difference]: Without dead ends: 5240 [2024-10-13 11:57:41,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-13 11:57:41,461 INFO L432 NwaCegarLoop]: 1801 mSDtfsCounter, 770 mSDsluCounter, 3534 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 5335 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:41,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 5335 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 11:57:41,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5240 states. [2024-10-13 11:57:41,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5240 to 4555. [2024-10-13 11:57:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4555 states, 3597 states have (on average 1.966360856269113) internal successors, (7073), 4512 states have internal predecessors, (7073), 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-13 11:57:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4555 states to 4555 states and 7159 transitions. [2024-10-13 11:57:41,493 INFO L78 Accepts]: Start accepts. Automaton has 4555 states and 7159 transitions. Word has length 56 [2024-10-13 11:57:41,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:41,494 INFO L471 AbstractCegarLoop]: Abstraction has 4555 states and 7159 transitions. [2024-10-13 11:57:41,494 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-13 11:57:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 7159 transitions. [2024-10-13 11:57:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 11:57:41,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:41,494 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-13 11:57:41,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:41,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:41,695 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:41,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:41,695 INFO L85 PathProgramCache]: Analyzing trace with hash -515790006, now seen corresponding path program 1 times [2024-10-13 11:57:41,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:41,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687564512] [2024-10-13 11:57:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:41,696 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-13 11:57:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:41,698 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:41,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-13 11:57:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:41,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:57:41,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:41,992 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-13 11:57:41,995 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-13 11:57:42,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:57:42,262 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-13 11:57:42,269 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:57:42,269 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-13 11:57:42,276 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-13 11:57:42,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:42,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:42,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687564512] [2024-10-13 11:57:42,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687564512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:42,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:42,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:57:42,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740339550] [2024-10-13 11:57:42,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:42,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:42,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:42,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:42,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:42,277 INFO L87 Difference]: Start difference. First operand 4555 states and 7159 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-13 11:57:44,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:44,527 INFO L93 Difference]: Finished difference Result 4471 states and 6916 transitions. [2024-10-13 11:57:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:44,528 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-13 11:57:44,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:44,531 INFO L225 Difference]: With dead ends: 4471 [2024-10-13 11:57:44,531 INFO L226 Difference]: Without dead ends: 4471 [2024-10-13 11:57:44,532 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-13 11:57:44,532 INFO L432 NwaCegarLoop]: 818 mSDtfsCounter, 2896 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2906 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:44,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2906 Valid, 1013 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 11:57:44,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4471 states. [2024-10-13 11:57:44,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4471 to 4361. [2024-10-13 11:57:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4361 states, 3487 states have (on average 1.8938915973616288) internal successors, (6604), 4318 states have internal predecessors, (6604), 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-13 11:57:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4361 states to 4361 states and 6690 transitions. [2024-10-13 11:57:44,558 INFO L78 Accepts]: Start accepts. Automaton has 4361 states and 6690 transitions. Word has length 56 [2024-10-13 11:57:44,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:44,558 INFO L471 AbstractCegarLoop]: Abstraction has 4361 states and 6690 transitions. [2024-10-13 11:57:44,559 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-13 11:57:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 4361 states and 6690 transitions. [2024-10-13 11:57:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 11:57:44,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:44,559 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-13 11:57:44,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-10-13 11:57:44,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:44,760 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:44,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:44,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1760157610, now seen corresponding path program 1 times [2024-10-13 11:57:44,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:44,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20730820] [2024-10-13 11:57:44,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:44,761 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-13 11:57:44,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:44,762 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:44,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-13 11:57:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:45,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:57:45,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:45,012 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-13 11:57:45,023 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-13 11:57:45,039 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-13 11:57:45,046 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-13 11:57:45,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:45,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:45,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20730820] [2024-10-13 11:57:45,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20730820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:45,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:45,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:45,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554424529] [2024-10-13 11:57:45,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:45,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:57:45,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:45,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:57:45,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:57:45,047 INFO L87 Difference]: Start difference. First operand 4361 states and 6690 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-13 11:57:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:47,934 INFO L93 Difference]: Finished difference Result 4360 states and 6687 transitions. [2024-10-13 11:57:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:57:47,935 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-13 11:57:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:47,939 INFO L225 Difference]: With dead ends: 4360 [2024-10-13 11:57:47,939 INFO L226 Difference]: Without dead ends: 4360 [2024-10-13 11:57:47,939 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-13 11:57:47,939 INFO L432 NwaCegarLoop]: 1722 mSDtfsCounter, 2 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 3032 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4664 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:47,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4664 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3032 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 11:57:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2024-10-13 11:57:47,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 4360. [2024-10-13 11:57:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4360 states, 3487 states have (on average 1.8930312589618583) internal successors, (6601), 4317 states have internal predecessors, (6601), 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-13 11:57:47,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4360 states to 4360 states and 6687 transitions. [2024-10-13 11:57:47,971 INFO L78 Accepts]: Start accepts. Automaton has 4360 states and 6687 transitions. Word has length 60 [2024-10-13 11:57:47,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:47,971 INFO L471 AbstractCegarLoop]: Abstraction has 4360 states and 6687 transitions. [2024-10-13 11:57:47,971 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-13 11:57:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand 4360 states and 6687 transitions. [2024-10-13 11:57:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 11:57:47,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:47,972 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-13 11:57:47,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:48,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:48,172 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:48,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:48,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1760157609, now seen corresponding path program 1 times [2024-10-13 11:57:48,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:48,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038565628] [2024-10-13 11:57:48,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:48,173 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-13 11:57:48,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:48,176 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:48,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-10-13 11:57:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:48,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 11:57:48,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:48,424 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-13 11:57:48,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 11:57:48,442 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-13 11:57:48,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 11:57:48,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-13 11:57:48,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:48,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:48,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038565628] [2024-10-13 11:57:48,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038565628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:48,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:48,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:48,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496369540] [2024-10-13 11:57:48,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:48,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:57:48,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:48,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:57:48,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:57:48,483 INFO L87 Difference]: Start difference. First operand 4360 states and 6687 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-13 11:57:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:52,169 INFO L93 Difference]: Finished difference Result 4359 states and 6684 transitions. [2024-10-13 11:57:52,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:57:52,170 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-13 11:57:52,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:52,174 INFO L225 Difference]: With dead ends: 4359 [2024-10-13 11:57:52,174 INFO L226 Difference]: Without dead ends: 4359 [2024-10-13 11:57:52,175 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-13 11:57:52,175 INFO L432 NwaCegarLoop]: 1722 mSDtfsCounter, 1 mSDsluCounter, 2918 mSDsCounter, 0 mSdLazyCounter, 3053 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4640 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:52,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4640 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3053 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 11:57:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4359 states. [2024-10-13 11:57:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4359 to 4359. [2024-10-13 11:57:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4359 states, 3484 states have (on average 1.8938002296211252) internal successors, (6598), 4316 states have internal predecessors, (6598), 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-13 11:57:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6684 transitions. [2024-10-13 11:57:52,218 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6684 transitions. Word has length 60 [2024-10-13 11:57:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:52,219 INFO L471 AbstractCegarLoop]: Abstraction has 4359 states and 6684 transitions. [2024-10-13 11:57:52,219 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-13 11:57:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6684 transitions. [2024-10-13 11:57:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 11:57:52,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:52,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:57:52,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:52,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:52,420 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:52,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:52,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1872695782, now seen corresponding path program 1 times [2024-10-13 11:57:52,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:52,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207583255] [2024-10-13 11:57:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:52,421 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-13 11:57:52,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:52,422 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:52,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-10-13 11:57:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:52,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:57:52,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:57:52,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:52,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:52,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207583255] [2024-10-13 11:57:52,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207583255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:52,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:52,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:52,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485416059] [2024-10-13 11:57:52,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:52,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:52,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:52,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:52,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:52,684 INFO L87 Difference]: Start difference. First operand 4359 states and 6684 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:57:53,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:53,661 INFO L93 Difference]: Finished difference Result 4361 states and 6691 transitions. [2024-10-13 11:57:53,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:53,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2024-10-13 11:57:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:53,670 INFO L225 Difference]: With dead ends: 4361 [2024-10-13 11:57:53,670 INFO L226 Difference]: Without dead ends: 4361 [2024-10-13 11:57:53,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:53,671 INFO L432 NwaCegarLoop]: 1721 mSDtfsCounter, 0 mSDsluCounter, 3436 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5157 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:53,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5157 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:57:53,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4361 states. [2024-10-13 11:57:53,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4361 to 4361. [2024-10-13 11:57:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4361 states, 3485 states have (on average 1.8938307030129125) internal successors, (6600), 4318 states have internal predecessors, (6600), 43 states have call successors, (43), 3 states have call predecessors, (43), 4 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-10-13 11:57:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4361 states to 4361 states and 6691 transitions. [2024-10-13 11:57:53,726 INFO L78 Accepts]: Start accepts. Automaton has 4361 states and 6691 transitions. Word has length 66 [2024-10-13 11:57:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:53,727 INFO L471 AbstractCegarLoop]: Abstraction has 4361 states and 6691 transitions. [2024-10-13 11:57:53,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:57:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 4361 states and 6691 transitions. [2024-10-13 11:57:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 11:57:53,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:53,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:57:53,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-10-13 11:57:53,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:53,928 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:53,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:53,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1902795339, now seen corresponding path program 1 times [2024-10-13 11:57:53,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:53,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002433633] [2024-10-13 11:57:53,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:53,929 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-13 11:57:53,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:53,930 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:53,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-10-13 11:57:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:54,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:57:54,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:57:54,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:57:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:57:54,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:54,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002433633] [2024-10-13 11:57:54,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002433633] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:57:54,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:57:54,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 11:57:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840239347] [2024-10-13 11:57:54,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:57:54,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:57:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:54,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:57:54,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:57:54,274 INFO L87 Difference]: Start difference. First operand 4361 states and 6691 transitions. Second operand has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:57:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:56,015 INFO L93 Difference]: Finished difference Result 4370 states and 6709 transitions. [2024-10-13 11:57:56,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:57:56,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2024-10-13 11:57:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:56,023 INFO L225 Difference]: With dead ends: 4370 [2024-10-13 11:57:56,023 INFO L226 Difference]: Without dead ends: 4370 [2024-10-13 11:57:56,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:57:56,024 INFO L432 NwaCegarLoop]: 1719 mSDtfsCounter, 4 mSDsluCounter, 8575 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10294 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:56,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10294 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 11:57:56,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states. [2024-10-13 11:57:56,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 4369. [2024-10-13 11:57:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4369 states, 3492 states have (on average 1.8937571592210767) internal successors, (6613), 4325 states have internal predecessors, (6613), 43 states have call successors, (43), 4 states have call predecessors, (43), 5 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-10-13 11:57:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4369 states to 4369 states and 6704 transitions. [2024-10-13 11:57:56,067 INFO L78 Accepts]: Start accepts. Automaton has 4369 states and 6704 transitions. Word has length 67 [2024-10-13 11:57:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:56,067 INFO L471 AbstractCegarLoop]: Abstraction has 4369 states and 6704 transitions. [2024-10-13 11:57:56,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:57:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4369 states and 6704 transitions. [2024-10-13 11:57:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 11:57:56,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:56,070 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:57:56,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:56,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:56,270 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:56,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash -744522534, now seen corresponding path program 2 times [2024-10-13 11:57:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604977095] [2024-10-13 11:57:56,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:57:56,271 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-13 11:57:56,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:56,274 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:56,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-10-13 11:57:56,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:57:56,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:57:56,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:57:56,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:57:56,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:57:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:57:56,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:56,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604977095] [2024-10-13 11:57:56,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604977095] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:57:56,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:57:56,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 11:57:56,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788079409] [2024-10-13 11:57:56,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:57:56,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 11:57:56,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:56,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 11:57:56,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 11:57:56,920 INFO L87 Difference]: Start difference. First operand 4369 states and 6704 transitions. Second operand has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:57:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:59,131 INFO L93 Difference]: Finished difference Result 4381 states and 6722 transitions. [2024-10-13 11:57:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:57:59,131 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2024-10-13 11:57:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:59,138 INFO L225 Difference]: With dead ends: 4381 [2024-10-13 11:57:59,138 INFO L226 Difference]: Without dead ends: 4378 [2024-10-13 11:57:59,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 11:57:59,139 INFO L432 NwaCegarLoop]: 1719 mSDtfsCounter, 8 mSDsluCounter, 8581 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10300 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:59,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10300 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 11:57:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2024-10-13 11:57:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 4378. [2024-10-13 11:57:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4378 states, 3501 states have (on average 1.8920308483290489) internal successors, (6624), 4334 states have internal predecessors, (6624), 43 states have call successors, (43), 4 states have call predecessors, (43), 5 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-10-13 11:57:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 6715 transitions. [2024-10-13 11:57:59,180 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 6715 transitions. Word has length 70 [2024-10-13 11:57:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:59,181 INFO L471 AbstractCegarLoop]: Abstraction has 4378 states and 6715 transitions. [2024-10-13 11:57:59,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:57:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 6715 transitions. [2024-10-13 11:57:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-13 11:57:59,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:59,182 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:57:59,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-10-13 11:57:59,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:59,383 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-13 11:57:59,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:59,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2095694086, now seen corresponding path program 3 times [2024-10-13 11:57:59,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:59,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725962033] [2024-10-13 11:57:59,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 11:57:59,384 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-13 11:57:59,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:59,386 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:57:59,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process