./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_test4-2.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_test4-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e095bb5ea0d924a9f9ab04ab393eec77de9b1aa4e50357711d33ebab16e651dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:56:38,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:56:38,708 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:38,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:56:38,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:56:38,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:56:38,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:56:38,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:56:38,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:56:38,745 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:56:38,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:56:38,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:56:38,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:56:38,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:56:38,753 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:56:38,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:56:38,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:56:38,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:56:38,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:56:38,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:56:38,755 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:56:38,757 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:56:38,757 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:56:38,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:56:38,758 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:56:38,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:56:38,758 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:56:38,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:56:38,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:56:38,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:56:38,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:56:38,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:56:38,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:56:38,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:56:38,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:56:38,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:56:38,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:56:38,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:56:38,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:56:38,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:56:38,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:56:38,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:56:38,764 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 -> e095bb5ea0d924a9f9ab04ab393eec77de9b1aa4e50357711d33ebab16e651dd [2024-10-13 11:56:38,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:56:39,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:56:39,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:56:39,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:56:39,021 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:56:39,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i [2024-10-13 11:56:40,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:56:40,848 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:56:40,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i [2024-10-13 11:56:40,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a143f27/6b6ee9e226594ece9ba2fab7c2b03b14/FLAG5072326cb [2024-10-13 11:56:40,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a143f27/6b6ee9e226594ece9ba2fab7c2b03b14 [2024-10-13 11:56:40,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:56:40,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:56:40,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:56:40,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:56:40,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:56:40,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:56:40" (1/1) ... [2024-10-13 11:56:40,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6963b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:40, skipping insertion in model container [2024-10-13 11:56:40,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:56:40" (1/1) ... [2024-10-13 11:56:40,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:56:41,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:56:41,537 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:41,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@334ed8de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:41, skipping insertion in model container [2024-10-13 11:56:41,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:56:41,538 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:56:41,541 INFO L158 Benchmark]: Toolchain (without parser) took 645.88ms. Allocated memory is still 153.1MB. Free memory was 78.3MB in the beginning and 110.9MB in the end (delta: -32.6MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-10-13 11:56:41,541 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 153.1MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:56:41,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 643.76ms. Allocated memory is still 153.1MB. Free memory was 78.2MB in the beginning and 110.9MB in the end (delta: -32.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-10-13 11:56:41,543 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 153.1MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 643.76ms. Allocated memory is still 153.1MB. Free memory was 78.2MB in the beginning and 110.9MB in the end (delta: -32.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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_test4-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e095bb5ea0d924a9f9ab04ab393eec77de9b1aa4e50357711d33ebab16e651dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:56:43,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:56:43,573 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:43,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:56:43,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:56:43,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:56:43,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:56:43,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:56:43,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:56:43,614 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:56:43,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:56:43,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:56:43,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:56:43,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:56:43,618 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:56:43,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:56:43,619 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:56:43,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:56:43,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:56:43,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:56:43,622 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:56:43,625 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:56:43,625 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:56:43,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:56:43,626 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:56:43,626 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:56:43,626 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:56:43,626 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:56:43,627 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:56:43,627 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:56:43,627 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:56:43,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:56:43,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:56:43,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:56:43,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:56:43,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:56:43,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:56:43,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:56:43,631 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:56:43,632 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:56:43,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:56:43,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:56:43,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:56:43,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:56:43,633 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:56:43,633 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 -> e095bb5ea0d924a9f9ab04ab393eec77de9b1aa4e50357711d33ebab16e651dd [2024-10-13 11:56:43,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:56:43,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:56:43,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:56:43,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:56:43,984 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:56:43,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i [2024-10-13 11:56:45,443 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:56:45,757 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:56:45,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i [2024-10-13 11:56:45,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2767edb47/30c0ec560a63458c9ff26b74d3ddf390/FLAG5bd46495e [2024-10-13 11:56:45,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2767edb47/30c0ec560a63458c9ff26b74d3ddf390 [2024-10-13 11:56:45,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:56:45,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:56:45,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:56:45,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:56:45,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:56:45,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:56:45" (1/1) ... [2024-10-13 11:56:45,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6191e924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:45, skipping insertion in model container [2024-10-13 11:56:45,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:56:45" (1/1) ... [2024-10-13 11:56:45,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:56:46,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:56:46,436 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:56:46,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:56:46,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:56:46,563 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:56:46,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:56:46,725 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:56:46,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:46 WrapperNode [2024-10-13 11:56:46,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:56:46,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:56:46,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:56:46,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:56:46,734 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:46" (1/1) ... [2024-10-13 11:56:46,771 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:46" (1/1) ... [2024-10-13 11:56:46,836 INFO L138 Inliner]: procedures = 179, calls = 387, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1351 [2024-10-13 11:56:46,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:56:46,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:56:46,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:56:46,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:56:46,849 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:46" (1/1) ... [2024-10-13 11:56:46,849 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:46" (1/1) ... [2024-10-13 11:56:46,881 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:46" (1/1) ... [2024-10-13 11:56:47,013 INFO L175 MemorySlicer]: Split 357 memory accesses to 2 slices as follows [2, 355]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 90 writes are split as follows [0, 90]. [2024-10-13 11:56:47,014 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:46" (1/1) ... [2024-10-13 11:56:47,014 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:46" (1/1) ... [2024-10-13 11:56:47,055 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:46" (1/1) ... [2024-10-13 11:56:47,064 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:46" (1/1) ... [2024-10-13 11:56:47,070 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:46" (1/1) ... [2024-10-13 11:56:47,077 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:46" (1/1) ... [2024-10-13 11:56:47,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:56:47,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:56:47,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:56:47,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:56:47,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:46" (1/1) ... [2024-10-13 11:56:47,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:56:47,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:56:47,147 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:47,153 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:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:56:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:56:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:56:47,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:56:47,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 11:56:47,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 11:56:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 11:56:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 11:56:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 11:56:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 11:56:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:56:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:56:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:56:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:56:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:56:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:56:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:56:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:56:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:56:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:56:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:56:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:56:47,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:56:47,451 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:56:47,453 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:56:47,457 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:56:47,521 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:56:52,140 INFO L? ?]: Removed 1547 outVars from TransFormulas that were not future-live. [2024-10-13 11:56:52,140 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:56:52,368 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:56:52,368 INFO L314 CfgBuilder]: Removed 69 assume(true) statements. [2024-10-13 11:56:52,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:56:52 BoogieIcfgContainer [2024-10-13 11:56:52,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:56:52,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:56:52,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:56:52,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:56:52,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:56:45" (1/3) ... [2024-10-13 11:56:52,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f23c08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:56:52, skipping insertion in model container [2024-10-13 11:56:52,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:56:46" (2/3) ... [2024-10-13 11:56:52,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f23c08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:56:52, skipping insertion in model container [2024-10-13 11:56:52,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:56:52" (3/3) ... [2024-10-13 11:56:52,377 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-2.i [2024-10-13 11:56:52,396 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:56:52,396 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 733 error locations. [2024-10-13 11:56:52,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:56:52,489 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;@d3421d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:56:52,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 733 error locations. [2024-10-13 11:56:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 1312 states, 566 states have (on average 2.545936395759717) internal successors, (1441), 1303 states have internal predecessors, (1441), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:56:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 11:56:52,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:56:52,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 11:56:52,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:56:52,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:56:52,512 INFO L85 PathProgramCache]: Analyzing trace with hash 69709116, now seen corresponding path program 1 times [2024-10-13 11:56:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:56:52,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202790398] [2024-10-13 11:56:52,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:56:52,525 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,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:56:52,529 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:52,535 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:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:56:52,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:56:52,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:56:52,753 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,770 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,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:56:52,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:56:52,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202790398] [2024-10-13 11:56:52,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202790398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:56:52,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:56:52,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:56:52,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744139515] [2024-10-13 11:56:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:56:52,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:56:52,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:56:52,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:56:52,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:56:52,815 INFO L87 Difference]: Start difference. First operand has 1312 states, 566 states have (on average 2.545936395759717) internal successors, (1441), 1303 states have internal predecessors, (1441), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:56:54,863 INFO L93 Difference]: Finished difference Result 1201 states and 1285 transitions. [2024-10-13 11:56:54,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:56:54,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-10-13 11:56:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:56:54,883 INFO L225 Difference]: With dead ends: 1201 [2024-10-13 11:56:54,883 INFO L226 Difference]: Without dead ends: 1200 [2024-10-13 11:56:54,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:54,888 INFO L432 NwaCegarLoop]: 652 mSDtfsCounter, 926 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:56:54,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 747 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 11:56:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-10-13 11:56:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1198. [2024-10-13 11:56:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 557 states have (on average 2.2423698384201076) internal successors, (1249), 1189 states have internal predecessors, (1249), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:56:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1281 transitions. [2024-10-13 11:56:54,983 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1281 transitions. Word has length 4 [2024-10-13 11:56:54,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:56:54,984 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1281 transitions. [2024-10-13 11:56:54,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1281 transitions. [2024-10-13 11:56:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 11:56:54,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:56:54,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 11:56:54,989 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:55,187 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:55,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:56:55,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:56:55,188 INFO L85 PathProgramCache]: Analyzing trace with hash 69709117, now seen corresponding path program 1 times [2024-10-13 11:56:55,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:56:55,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166791683] [2024-10-13 11:56:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:56:55,189 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,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:56:55,193 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:55,205 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:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:56:55,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:56:55,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:56:55,391 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,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:56:55,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:56:55,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:56:55,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166791683] [2024-10-13 11:56:55,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166791683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:56:55,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:56:55,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:56:55,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465620959] [2024-10-13 11:56:55,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:56:55,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:56:55,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:56:55,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:56:55,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:56:55,427 INFO L87 Difference]: Start difference. First operand 1198 states and 1281 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:56:58,017 INFO L93 Difference]: Finished difference Result 1478 states and 1581 transitions. [2024-10-13 11:56:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:56:58,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-10-13 11:56:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:56:58,025 INFO L225 Difference]: With dead ends: 1478 [2024-10-13 11:56:58,025 INFO L226 Difference]: Without dead ends: 1478 [2024-10-13 11:56:58,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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,027 INFO L432 NwaCegarLoop]: 958 mSDtfsCounter, 464 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:56:58,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1429 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 11:56:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2024-10-13 11:56:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1327. [2024-10-13 11:56:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 696 states have (on average 2.199712643678161) internal successors, (1531), 1318 states have internal predecessors, (1531), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:56:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1563 transitions. [2024-10-13 11:56:58,069 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1563 transitions. Word has length 4 [2024-10-13 11:56:58,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:56:58,070 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1563 transitions. [2024-10-13 11:56:58,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1563 transitions. [2024-10-13 11:56:58,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 11:56:58,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:56:58,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 11:56:58,079 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 11:56:58,274 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:58,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:56:58,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:56:58,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2132325201, now seen corresponding path program 1 times [2024-10-13 11:56:58,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:56:58,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192652193] [2024-10-13 11:56:58,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:56:58,276 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:58,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:56:58,279 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:58,280 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:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:56:58,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:56:58,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:56:58,405 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:58,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:56:58,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:56:58,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192652193] [2024-10-13 11:56:58,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192652193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:56:58,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:56:58,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:56:58,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689022280] [2024-10-13 11:56:58,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:56:58,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:56:58,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:56:58,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:56:58,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:56:58,410 INFO L87 Difference]: Start difference. First operand 1327 states and 1563 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:56:59,694 INFO L93 Difference]: Finished difference Result 2427 states and 2868 transitions. [2024-10-13 11:56:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:56:59,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-10-13 11:56:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:56:59,705 INFO L225 Difference]: With dead ends: 2427 [2024-10-13 11:56:59,705 INFO L226 Difference]: Without dead ends: 2427 [2024-10-13 11:56:59,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:59,708 INFO L432 NwaCegarLoop]: 1308 mSDtfsCounter, 1000 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:56:59,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 2436 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:56:59,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2024-10-13 11:56:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 1328. [2024-10-13 11:56:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 697 states have (on average 2.1979913916786225) internal successors, (1532), 1319 states have internal predecessors, (1532), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:56:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1564 transitions. [2024-10-13 11:56:59,750 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1564 transitions. Word has length 5 [2024-10-13 11:56:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:56:59,750 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 1564 transitions. [2024-10-13 11:56:59,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1564 transitions. [2024-10-13 11:56:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 11:56:59,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:56:59,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:56:59,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 11:56:59,953 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:59,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:56:59,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:56:59,955 INFO L85 PathProgramCache]: Analyzing trace with hash 358375302, now seen corresponding path program 1 times [2024-10-13 11:56:59,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:56:59,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315187890] [2024-10-13 11:56:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:56:59,955 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,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:56:59,959 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:59,960 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:57:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:00,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:57:00,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:00,109 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,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:00,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:00,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315187890] [2024-10-13 11:57:00,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315187890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:00,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:00,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:57:00,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107392036] [2024-10-13 11:57:00,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:00,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:57:00,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:00,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:57:00,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:57:00,112 INFO L87 Difference]: Start difference. First operand 1328 states and 1564 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,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:00,899 INFO L93 Difference]: Finished difference Result 1289 states and 1524 transitions. [2024-10-13 11:57:00,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:57:00,901 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,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:00,906 INFO L225 Difference]: With dead ends: 1289 [2024-10-13 11:57:00,906 INFO L226 Difference]: Without dead ends: 1289 [2024-10-13 11:57:00,907 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,908 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 61 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:00,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2126 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 11:57:00,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-10-13 11:57:00,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2024-10-13 11:57:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 682 states have (on average 2.187683284457478) internal successors, (1492), 1280 states have internal predecessors, (1492), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:57:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1524 transitions. [2024-10-13 11:57:00,945 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1524 transitions. Word has length 10 [2024-10-13 11:57:00,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:00,946 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1524 transitions. [2024-10-13 11:57:00,946 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,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1524 transitions. [2024-10-13 11:57:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:57:00,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:00,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:57:00,953 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:57:01,147 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:57:01,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:01,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash 801277664, now seen corresponding path program 1 times [2024-10-13 11:57:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378308867] [2024-10-13 11:57:01,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:01,153 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,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:01,156 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:57:01,157 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:57:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:01,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:57:01,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:01,305 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:01,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:01,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:01,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378308867] [2024-10-13 11:57:01,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378308867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:01,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:01,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:01,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793179793] [2024-10-13 11:57:01,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:01,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:01,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:01,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:01,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:01,310 INFO L87 Difference]: Start difference. First operand 1289 states and 1524 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:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:02,211 INFO L93 Difference]: Finished difference Result 1274 states and 1502 transitions. [2024-10-13 11:57:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:57:02,213 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:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:02,218 INFO L225 Difference]: With dead ends: 1274 [2024-10-13 11:57:02,219 INFO L226 Difference]: Without dead ends: 1274 [2024-10-13 11:57:02,219 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:02,220 INFO L432 NwaCegarLoop]: 1053 mSDtfsCounter, 45 mSDsluCounter, 2088 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:02,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3141 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:57:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-10-13 11:57:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1274. [2024-10-13 11:57:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 681 states have (on average 2.158590308370044) internal successors, (1470), 1265 states have internal predecessors, (1470), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:57:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1502 transitions. [2024-10-13 11:57:02,245 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1502 transitions. Word has length 12 [2024-10-13 11:57:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:02,245 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1502 transitions. [2024-10-13 11:57:02,245 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:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1502 transitions. [2024-10-13 11:57:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:57:02,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:02,247 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:02,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:02,447 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:57:02,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:02,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:02,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1911588786, now seen corresponding path program 1 times [2024-10-13 11:57:02,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:02,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969326828] [2024-10-13 11:57:02,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:02,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:02,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:02,453 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:57:02,455 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:57:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:02,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:57:02,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:02,598 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:02,684 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,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:02,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:02,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969326828] [2024-10-13 11:57:02,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969326828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:02,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:02,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:57:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521302625] [2024-10-13 11:57:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:02,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:02,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:02,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:02,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:02,686 INFO L87 Difference]: Start difference. First operand 1274 states and 1502 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:04,906 INFO L93 Difference]: Finished difference Result 1274 states and 1502 transitions. [2024-10-13 11:57:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:04,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:04,910 INFO L225 Difference]: With dead ends: 1274 [2024-10-13 11:57:04,910 INFO L226 Difference]: Without dead ends: 1274 [2024-10-13 11:57:04,911 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:04,911 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 870 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:04,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1174 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 11:57:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-10-13 11:57:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1270. [2024-10-13 11:57:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 681 states have (on average 2.1527165932452275) internal successors, (1466), 1261 states have internal predecessors, (1466), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:57:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1498 transitions. [2024-10-13 11:57:04,931 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1498 transitions. Word has length 26 [2024-10-13 11:57:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:04,931 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1498 transitions. [2024-10-13 11:57:04,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1498 transitions. [2024-10-13 11:57:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:57:04,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:04,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:57:04,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:05,133 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:05,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:05,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1911588785, now seen corresponding path program 1 times [2024-10-13 11:57:05,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:05,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593375110] [2024-10-13 11:57:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:05,135 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,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:05,138 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:05,139 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:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:05,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:57:05,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:05,305 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:05,494 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,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:05,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:05,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593375110] [2024-10-13 11:57:05,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593375110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:05,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:05,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:57:05,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375771] [2024-10-13 11:57:05,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:05,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:05,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:05,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:05,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:05,496 INFO L87 Difference]: Start difference. First operand 1270 states and 1498 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:07,922 INFO L93 Difference]: Finished difference Result 1421 states and 1516 transitions. [2024-10-13 11:57:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:07,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:07,926 INFO L225 Difference]: With dead ends: 1421 [2024-10-13 11:57:07,926 INFO L226 Difference]: Without dead ends: 1421 [2024-10-13 11:57:07,926 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:07,927 INFO L432 NwaCegarLoop]: 922 mSDtfsCounter, 404 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:07,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1901 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 11:57:07,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2024-10-13 11:57:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1266. [2024-10-13 11:57:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 681 states have (on average 2.146842878120411) internal successors, (1462), 1257 states have internal predecessors, (1462), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:57:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1494 transitions. [2024-10-13 11:57:07,945 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1494 transitions. Word has length 26 [2024-10-13 11:57:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:07,946 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1494 transitions. [2024-10-13 11:57:07,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1494 transitions. [2024-10-13 11:57:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 11:57:07,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:07,947 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] [2024-10-13 11:57:07,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 11:57:08,147 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:08,148 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:08,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:08,148 INFO L85 PathProgramCache]: Analyzing trace with hash 470489544, now seen corresponding path program 1 times [2024-10-13 11:57:08,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:08,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048688696] [2024-10-13 11:57:08,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:08,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:08,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:08,150 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:08,151 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:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:08,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:57:08,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:08,367 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:08,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:08,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:08,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048688696] [2024-10-13 11:57:08,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048688696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:08,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:08,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:08,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922717973] [2024-10-13 11:57:08,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:08,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:08,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:08,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:08,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:08,369 INFO L87 Difference]: Start difference. First operand 1266 states and 1494 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:09,125 INFO L93 Difference]: Finished difference Result 1260 states and 1484 transitions. [2024-10-13 11:57:09,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:57:09,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-13 11:57:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:09,129 INFO L225 Difference]: With dead ends: 1260 [2024-10-13 11:57:09,129 INFO L226 Difference]: Without dead ends: 1260 [2024-10-13 11:57:09,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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:09,130 INFO L432 NwaCegarLoop]: 1047 mSDtfsCounter, 15 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:09,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3124 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:57:09,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2024-10-13 11:57:09,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1260. [2024-10-13 11:57:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 675 states have (on average 2.151111111111111) internal successors, (1452), 1251 states have internal predecessors, (1452), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:57:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1484 transitions. [2024-10-13 11:57:09,150 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1484 transitions. Word has length 42 [2024-10-13 11:57:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:09,150 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1484 transitions. [2024-10-13 11:57:09,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1484 transitions. [2024-10-13 11:57:09,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 11:57:09,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:09,153 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] [2024-10-13 11:57:09,160 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:09,354 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:09,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:09,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:09,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1674619112, now seen corresponding path program 1 times [2024-10-13 11:57:09,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:09,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392207766] [2024-10-13 11:57:09,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:09,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:57:09,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:09,357 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:09,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 11:57:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:09,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:57:09,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:09,797 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:09,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:09,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:09,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392207766] [2024-10-13 11:57:09,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392207766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:09,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:09,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:57:09,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348918610] [2024-10-13 11:57:09,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:09,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:57:09,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:09,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:57:09,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:57:09,800 INFO L87 Difference]: Start difference. First operand 1260 states and 1484 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:10,546 INFO L93 Difference]: Finished difference Result 1457 states and 1710 transitions. [2024-10-13 11:57:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:57:10,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-13 11:57:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:10,551 INFO L225 Difference]: With dead ends: 1457 [2024-10-13 11:57:10,551 INFO L226 Difference]: Without dead ends: 1457 [2024-10-13 11:57:10,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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:10,552 INFO L432 NwaCegarLoop]: 1114 mSDtfsCounter, 161 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:10,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 2114 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:57:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2024-10-13 11:57:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1303. [2024-10-13 11:57:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 718 states have (on average 2.082172701949861) internal successors, (1495), 1294 states have internal predecessors, (1495), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:57:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1527 transitions. [2024-10-13 11:57:10,570 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1527 transitions. Word has length 46 [2024-10-13 11:57:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:10,571 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 1527 transitions. [2024-10-13 11:57:10,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1527 transitions. [2024-10-13 11:57:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 11:57:10,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:10,574 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:10,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 11:57:10,774 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:10,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:10,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:10,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1869617577, now seen corresponding path program 1 times [2024-10-13 11:57:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:10,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686758645] [2024-10-13 11:57:10,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:10,776 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,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:10,780 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:10,781 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:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:11,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:57:11,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:11,081 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:11,087 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:11,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:57:11,510 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:11,528 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:57:11,529 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:11,545 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:11,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:11,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:11,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686758645] [2024-10-13 11:57:11,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686758645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:11,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:11,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:57:11,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5987926] [2024-10-13 11:57:11,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:11,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:11,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:11,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:11,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:11,548 INFO L87 Difference]: Start difference. First operand 1303 states and 1527 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) 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:13,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:13,331 INFO L93 Difference]: Finished difference Result 1219 states and 1443 transitions. [2024-10-13 11:57:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:13,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) 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:13,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:13,335 INFO L225 Difference]: With dead ends: 1219 [2024-10-13 11:57:13,335 INFO L226 Difference]: Without dead ends: 1219 [2024-10-13 11:57:13,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 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:13,336 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 782 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:13,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 644 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 11:57:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-10-13 11:57:13,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1080. [2024-10-13 11:57:13,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 579 states have (on average 1.932642487046632) internal successors, (1119), 1071 states have internal predecessors, (1119), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:57:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1151 transitions. [2024-10-13 11:57:13,353 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1151 transitions. Word has length 49 [2024-10-13 11:57:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:13,353 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1151 transitions. [2024-10-13 11:57:13,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) 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:13,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1151 transitions. [2024-10-13 11:57:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 11:57:13,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:13,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:57:13,365 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:13,555 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:13,555 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:13,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:13,556 INFO L85 PathProgramCache]: Analyzing trace with hash -804994658, now seen corresponding path program 1 times [2024-10-13 11:57:13,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:13,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150678638] [2024-10-13 11:57:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:13,556 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:13,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:13,559 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:13,561 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:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:13,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:57:13,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:13,775 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:13,787 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:13,808 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:13,818 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:13,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:13,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150678638] [2024-10-13 11:57:13,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150678638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142597056] [2024-10-13 11:57:13,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:13,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:57:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:13,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:57:13,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:57:13,821 INFO L87 Difference]: Start difference. First operand 1080 states and 1151 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:16,001 INFO L93 Difference]: Finished difference Result 1079 states and 1150 transitions. [2024-10-13 11:57:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:57:16,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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:16,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:16,005 INFO L225 Difference]: With dead ends: 1079 [2024-10-13 11:57:16,005 INFO L226 Difference]: Without dead ends: 1079 [2024-10-13 11:57:16,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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:16,006 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 2 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:16,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2519 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 11:57:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2024-10-13 11:57:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2024-10-13 11:57:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 579 states have (on average 1.930915371329879) internal successors, (1118), 1070 states have internal predecessors, (1118), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:57:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1150 transitions. [2024-10-13 11:57:16,023 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1150 transitions. Word has length 53 [2024-10-13 11:57:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:16,023 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1150 transitions. [2024-10-13 11:57:16,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1150 transitions. [2024-10-13 11:57:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 11:57:16,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:16,026 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:16,034 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:16,227 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:16,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:16,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash -804994657, now seen corresponding path program 1 times [2024-10-13 11:57:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:16,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471947398] [2024-10-13 11:57:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:16,229 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:16,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:16,232 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:16,233 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:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:16,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 11:57:16,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:16,513 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:16,529 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:16,536 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:16,574 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:16,594 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:16,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:16,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:16,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471947398] [2024-10-13 11:57:16,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471947398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:16,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:16,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:16,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287900669] [2024-10-13 11:57:16,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:16,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:57:16,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:16,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:57:16,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:57:16,596 INFO L87 Difference]: Start difference. First operand 1079 states and 1150 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:19,326 INFO L93 Difference]: Finished difference Result 1078 states and 1149 transitions. [2024-10-13 11:57:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:57:19,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:19,329 INFO L225 Difference]: With dead ends: 1078 [2024-10-13 11:57:19,329 INFO L226 Difference]: Without dead ends: 1078 [2024-10-13 11:57:19,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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:19,330 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 1 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 1865 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:19,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2548 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1865 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 11:57:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-10-13 11:57:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2024-10-13 11:57:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 578 states have (on average 1.9325259515570934) internal successors, (1117), 1069 states have internal predecessors, (1117), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:57:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1149 transitions. [2024-10-13 11:57:19,345 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1149 transitions. Word has length 53 [2024-10-13 11:57:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:19,345 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1149 transitions. [2024-10-13 11:57:19,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1149 transitions. [2024-10-13 11:57:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 11:57:19,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:19,346 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] [2024-10-13 11:57:19,354 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:19,550 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:19,551 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:19,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:19,552 INFO L85 PathProgramCache]: Analyzing trace with hash -226575358, now seen corresponding path program 1 times [2024-10-13 11:57:19,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:19,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151491057] [2024-10-13 11:57:19,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:19,553 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:19,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:19,556 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:19,557 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:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:19,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:57:19,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:57:19,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:57:19,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:19,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151491057] [2024-10-13 11:57:19,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151491057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:57:19,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:57:19,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:57:19,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943636852] [2024-10-13 11:57:19,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:57:19,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:57:19,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:19,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:57:19,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:57:19,880 INFO L87 Difference]: Start difference. First operand 1078 states and 1149 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:20,632 INFO L93 Difference]: Finished difference Result 1080 states and 1153 transitions. [2024-10-13 11:57:20,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:57:20,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 59 [2024-10-13 11:57:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:20,637 INFO L225 Difference]: With dead ends: 1080 [2024-10-13 11:57:20,637 INFO L226 Difference]: Without dead ends: 1080 [2024-10-13 11:57:20,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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:20,637 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 0 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2916 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:20,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2916 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:57:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-10-13 11:57:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1080. [2024-10-13 11:57:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 579 states have (on average 1.932642487046632) internal successors, (1119), 1071 states have internal predecessors, (1119), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 11:57:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1153 transitions. [2024-10-13 11:57:20,653 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1153 transitions. Word has length 59 [2024-10-13 11:57:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:20,654 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1153 transitions. [2024-10-13 11:57:20,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1153 transitions. [2024-10-13 11:57:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 11:57:20,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:20,655 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:20,668 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 (14)] Forceful destruction successful, exit code 0 [2024-10-13 11:57:20,858 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:20,859 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:20,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:20,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1204273177, now seen corresponding path program 1 times [2024-10-13 11:57:20,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:20,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446359441] [2024-10-13 11:57:20,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:57:20,860 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:20,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:20,861 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:20,862 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:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:57:21,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:57:21,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:21,144 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:21,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:57:21,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:21,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446359441] [2024-10-13 11:57:21,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446359441] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:57:21,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:57:21,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 11:57:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84173952] [2024-10-13 11:57:21,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:57:21,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:57:21,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:21,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:57:21,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:57:21,211 INFO L87 Difference]: Start difference. First operand 1080 states and 1153 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:22,382 INFO L93 Difference]: Finished difference Result 1089 states and 1168 transitions. [2024-10-13 11:57:22,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:57:22,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 60 [2024-10-13 11:57:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:22,385 INFO L225 Difference]: With dead ends: 1089 [2024-10-13 11:57:22,385 INFO L226 Difference]: Without dead ends: 1089 [2024-10-13 11:57:22,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:57:22,386 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 4 mSDsluCounter, 3874 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4846 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:22,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4846 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:57:22,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2024-10-13 11:57:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1088. [2024-10-13 11:57:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 586 states have (on average 1.931740614334471) internal successors, (1132), 1078 states have internal predecessors, (1132), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 11:57:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1166 transitions. [2024-10-13 11:57:22,399 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1166 transitions. Word has length 60 [2024-10-13 11:57:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:22,399 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1166 transitions. [2024-10-13 11:57:22,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1166 transitions. [2024-10-13 11:57:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 11:57:22,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:22,401 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] [2024-10-13 11:57:22,411 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:22,604 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:22,605 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:22,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:22,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1454574914, now seen corresponding path program 2 times [2024-10-13 11:57:22,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:22,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084145406] [2024-10-13 11:57:22,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:57:22,606 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:22,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:22,609 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:22,610 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:22,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:57:22,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:57:22,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:57:22,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:23,013 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:23,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:57:23,142 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:23,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:23,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084145406] [2024-10-13 11:57:23,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084145406] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:57:23,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:57:23,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 11:57:23,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730741264] [2024-10-13 11:57:23,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:57:23,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 11:57:23,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:23,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 11:57:23,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 11:57:23,145 INFO L87 Difference]: Start difference. First operand 1088 states and 1166 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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:25,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:25,460 INFO L93 Difference]: Finished difference Result 1100 states and 1186 transitions. [2024-10-13 11:57:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:57:25,461 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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 63 [2024-10-13 11:57:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:25,464 INFO L225 Difference]: With dead ends: 1100 [2024-10-13 11:57:25,464 INFO L226 Difference]: Without dead ends: 1098 [2024-10-13 11:57:25,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 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:25,465 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 7 mSDsluCounter, 7754 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8726 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:25,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8726 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 11:57:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-10-13 11:57:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1097. [2024-10-13 11:57:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 595 states have (on average 1.9226890756302522) internal successors, (1144), 1087 states have internal predecessors, (1144), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 11:57:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1178 transitions. [2024-10-13 11:57:25,480 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1178 transitions. Word has length 63 [2024-10-13 11:57:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:25,481 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1178 transitions. [2024-10-13 11:57:25,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1178 transitions. [2024-10-13 11:57:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 11:57:25,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:25,482 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] [2024-10-13 11:57:25,492 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:25,682 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:25,683 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:25,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1368824610, now seen corresponding path program 3 times [2024-10-13 11:57:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:25,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616965886] [2024-10-13 11:57:25,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 11:57:25,684 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,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:25,685 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:25,686 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:26,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 11:57:26,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:57:26,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 11:57:26,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:57:26,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:57:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:57:26,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:26,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616965886] [2024-10-13 11:57:26,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616965886] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:57:26,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:57:26,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 11:57:26,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651638205] [2024-10-13 11:57:26,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:57:26,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 11:57:26,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:26,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 11:57:26,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 11:57:26,767 INFO L87 Difference]: Start difference. First operand 1097 states and 1178 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:57:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:30,657 INFO L93 Difference]: Finished difference Result 1118 states and 1214 transitions. [2024-10-13 11:57:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 11:57:30,657 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-10-13 11:57:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:30,661 INFO L225 Difference]: With dead ends: 1118 [2024-10-13 11:57:30,661 INFO L226 Difference]: Without dead ends: 1115 [2024-10-13 11:57:30,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 11:57:30,662 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 13 mSDsluCounter, 10666 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11638 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:30,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11638 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 11:57:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-13 11:57:30,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2024-10-13 11:57:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 613 states have (on average 1.9037520391517129) internal successors, (1167), 1105 states have internal predecessors, (1167), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 11:57:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1201 transitions. [2024-10-13 11:57:30,679 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1201 transitions. Word has length 69 [2024-10-13 11:57:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:30,680 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1201 transitions. [2024-10-13 11:57:30,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:57:30,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1201 transitions. [2024-10-13 11:57:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 11:57:30,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:30,681 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:57:30,692 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 (17)] Ended with exit code 0 [2024-10-13 11:57:30,881 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:30,882 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:30,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:30,882 INFO L85 PathProgramCache]: Analyzing trace with hash 166592226, now seen corresponding path program 4 times [2024-10-13 11:57:30,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:30,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373868810] [2024-10-13 11:57:30,882 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 11:57:30,883 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,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:30,884 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:30,885 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:31,285 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 11:57:31,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:57:31,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 11:57:31,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:57:31,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:57:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:57:32,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:32,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373868810] [2024-10-13 11:57:32,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373868810] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:57:32,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:57:32,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 11:57:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688680845] [2024-10-13 11:57:32,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:57:32,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 11:57:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:57:32,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 11:57:32,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 11:57:32,791 INFO L87 Difference]: Start difference. First operand 1115 states and 1201 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:57:42,032 INFO L93 Difference]: Finished difference Result 1152 states and 1271 transitions. [2024-10-13 11:57:42,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 11:57:42,033 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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 81 [2024-10-13 11:57:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:57:42,036 INFO L225 Difference]: With dead ends: 1152 [2024-10-13 11:57:42,036 INFO L226 Difference]: Without dead ends: 1150 [2024-10-13 11:57:42,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 11:57:42,039 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 25 mSDsluCounter, 22310 mSDsCounter, 0 mSdLazyCounter, 5015 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 23282 SdHoareTripleChecker+Invalid, 5080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 5015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:57:42,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 23282 Invalid, 5080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 5015 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-10-13 11:57:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-10-13 11:57:42,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1149. [2024-10-13 11:57:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 647 states have (on average 1.8748068006182381) internal successors, (1213), 1139 states have internal predecessors, (1213), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 11:57:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1247 transitions. [2024-10-13 11:57:42,054 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1247 transitions. Word has length 81 [2024-10-13 11:57:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:57:42,054 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1247 transitions. [2024-10-13 11:57:42,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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:42,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1247 transitions. [2024-10-13 11:57:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 11:57:42,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:57:42,056 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:57:42,069 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:42,256 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:42,257 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:57:42,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:57:42,257 INFO L85 PathProgramCache]: Analyzing trace with hash 151378370, now seen corresponding path program 5 times [2024-10-13 11:57:42,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:57:42,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53732410] [2024-10-13 11:57:42,258 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:57:42,258 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:42,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:57:42,260 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:42,261 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:43,350 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-13 11:57:43,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:57:43,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-13 11:57:43,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:57:43,391 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-13 11:57:43,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-10-13 11:57:43,727 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-10-13 11:57:43,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-10-13 11:57:43,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:57:43,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2024-10-13 11:57:46,117 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:57:46,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-10-13 11:57:46,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-10-13 11:57:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 11:57:46,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:57:46,511 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-10-13 11:57:46,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:57:46,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53732410] [2024-10-13 11:57:46,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53732410] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:57:46,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2010840503] [2024-10-13 11:57:46,513 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:57:46,513 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 11:57:46,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 11:57:46,516 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 11:57:46,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process