./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-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 ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:47:32,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:47:32,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 15:47:32,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:47:32,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:47:32,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:47:32,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:47:32,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:47:32,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:47:32,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:47:32,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:47:32,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:47:32,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:47:32,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:47:32,797 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:47:32,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:47:32,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:47:32,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:47:32,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:47:32,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:47:32,802 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:47:32,803 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:47:32,803 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:47:32,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:47:32,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:47:32,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:47:32,804 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:47:32,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:47:32,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:47:32,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:47:32,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:47:32,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:47:32,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:47:32,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:47:32,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:47:32,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:47:32,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 15:47:32,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 15:47:32,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:47:32,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:47:32,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:47:32,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:47:32,810 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 -> ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 [2024-11-12 15:47:33,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:47:33,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:47:33,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:47:33,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:47:33,097 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:47:33,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2024-11-12 15:47:34,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:47:34,841 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:47:34,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2024-11-12 15:47:34,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b63eba3b4/7b46ac61437e44918e988913453c4b5a/FLAGf48bce3bc [2024-11-12 15:47:35,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b63eba3b4/7b46ac61437e44918e988913453c4b5a [2024-11-12 15:47:35,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:47:35,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:47:35,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:47:35,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:47:35,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:47:35,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:47:35" (1/1) ... [2024-11-12 15:47:35,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a29f253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:35, skipping insertion in model container [2024-11-12 15:47:35,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:47:35" (1/1) ... [2024-11-12 15:47:35,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:47:35,628 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,670 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,677 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,685 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,691 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,725 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,727 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,730 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,737 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,764 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,768 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,771 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,771 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,773 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,774 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,776 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,777 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,777 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,780 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:35,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:47:35,800 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-12 15:47:35,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7abdaa94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:35, skipping insertion in model container [2024-11-12 15:47:35,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:47:35,802 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 15:47:35,804 INFO L158 Benchmark]: Toolchain (without parser) took 693.56ms. Allocated memory is still 169.9MB. Free memory was 98.5MB in the beginning and 119.0MB in the end (delta: -20.6MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-12 15:47:35,804 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 169.9MB. Free memory was 129.5MB in the beginning and 129.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 15:47:35,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.79ms. Allocated memory is still 169.9MB. Free memory was 98.3MB in the beginning and 119.0MB in the end (delta: -20.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-12 15:47:35,807 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.20ms. Allocated memory is still 169.9MB. Free memory was 129.5MB in the beginning and 129.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 688.79ms. Allocated memory is still 169.9MB. Free memory was 98.3MB in the beginning and 119.0MB in the end (delta: -20.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-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 ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:47:37,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:47:37,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 15:47:37,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:47:37,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:47:37,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:47:37,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:47:37,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:47:37,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:47:37,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:47:37,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:47:37,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:47:37,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:47:37,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:47:37,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:47:37,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:47:37,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:47:37,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:47:37,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:47:37,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:47:37,956 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:47:37,960 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:47:37,960 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:47:37,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:47:37,961 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:47:37,961 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 15:47:37,961 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:47:37,961 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 15:47:37,962 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:47:37,962 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:47:37,962 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:47:37,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:47:37,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:47:37,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:47:37,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:47:37,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:47:37,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:47:37,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:47:37,964 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 15:47:37,964 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 15:47:37,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:47:37,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:47:37,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:47:37,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:47:37,966 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 -> ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 [2024-11-12 15:47:38,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:47:38,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:47:38,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:47:38,329 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:47:38,329 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:47:38,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2024-11-12 15:47:39,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:47:40,206 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:47:40,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2024-11-12 15:47:40,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce59e5734/e8a2a2a4a8464bfe9dd17e797ebef9d4/FLAG83fa033e2 [2024-11-12 15:47:40,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce59e5734/e8a2a2a4a8464bfe9dd17e797ebef9d4 [2024-11-12 15:47:40,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:47:40,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:47:40,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:47:40,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:47:40,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:47:40,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:47:40" (1/1) ... [2024-11-12 15:47:40,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10434a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:40, skipping insertion in model container [2024-11-12 15:47:40,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:47:40" (1/1) ... [2024-11-12 15:47:40,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:47:40,761 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,799 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,808 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,813 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,819 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,860 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,866 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,869 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,876 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,925 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,926 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,928 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,929 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,930 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,932 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,933 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,934 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,934 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,939 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:40,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:47:40,965 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 15:47:40,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:47:41,001 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,021 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,023 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,029 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,032 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,048 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,052 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,058 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,062 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,091 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,091 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,094 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,098 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,102 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,105 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,105 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,106 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,106 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,109 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:47:41,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:47:41,127 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 15:47:41,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:47:41,300 INFO L204 MainTranslator]: Completed translation [2024-11-12 15:47:41,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41 WrapperNode [2024-11-12 15:47:41,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:47:41,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 15:47:41,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 15:47:41,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 15:47:41,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41" (1/1) ... [2024-11-12 15:47:41,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41" (1/1) ... [2024-11-12 15:47:41,406 INFO L138 Inliner]: procedures = 180, calls = 426, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1612 [2024-11-12 15:47:41,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 15:47:41,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 15:47:41,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 15:47:41,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 15:47:41,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41" (1/1) ... [2024-11-12 15:47:41,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41" (1/1) ... [2024-11-12 15:47:41,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41" (1/1) ... [2024-11-12 15:47:41,564 INFO L175 MemorySlicer]: Split 397 memory accesses to 3 slices as follows [371, 2, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 91 writes are split as follows [90, 0, 1]. [2024-11-12 15:47:41,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41" (1/1) ... [2024-11-12 15:47:41,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41" (1/1) ... [2024-11-12 15:47:41,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41" (1/1) ... [2024-11-12 15:47:41,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41" (1/1) ... [2024-11-12 15:47:41,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41" (1/1) ... [2024-11-12 15:47:41,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41" (1/1) ... [2024-11-12 15:47:41,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 15:47:41,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 15:47:41,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 15:47:41,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 15:47:41,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41" (1/1) ... [2024-11-12 15:47:41,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:47:41,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:47:41,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 15:47:41,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 15:47:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-12 15:47:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-12 15:47:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 15:47:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 15:47:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 15:47:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 15:47:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 15:47:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 15:47:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 15:47:41,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 15:47:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 15:47:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 15:47:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 15:47:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 15:47:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 15:47:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 15:47:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 15:47:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 15:47:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 15:47:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 15:47:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 15:47:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 15:47:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 15:47:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 15:47:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 15:47:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 15:47:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 15:47:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 15:47:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 15:47:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 15:47:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 15:47:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 15:47:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 15:47:41,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 15:47:42,057 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 15:47:42,059 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 15:47:42,084 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:47:42,116 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:47:42,134 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:47:47,253 INFO L? ?]: Removed 1705 outVars from TransFormulas that were not future-live. [2024-11-12 15:47:47,253 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 15:47:47,305 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 15:47:47,306 INFO L316 CfgBuilder]: Removed 92 assume(true) statements. [2024-11-12 15:47:47,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:47:47 BoogieIcfgContainer [2024-11-12 15:47:47,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 15:47:47,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 15:47:47,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 15:47:47,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 15:47:47,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:47:40" (1/3) ... [2024-11-12 15:47:47,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a99bb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:47:47, skipping insertion in model container [2024-11-12 15:47:47,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:47:41" (2/3) ... [2024-11-12 15:47:47,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a99bb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:47:47, skipping insertion in model container [2024-11-12 15:47:47,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:47:47" (3/3) ... [2024-11-12 15:47:47,317 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-2.i [2024-11-12 15:47:47,334 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 15:47:47,334 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 817 error locations. [2024-11-12 15:47:47,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 15:47:47,426 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;@6f0eece5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 15:47:47,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 817 error locations. [2024-11-12 15:47:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 1644 states, 816 states have (on average 2.221813725490196) internal successors, (1813), 1634 states have internal predecessors, (1813), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:47:47,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 15:47:47,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:47:47,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 15:47:47,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:47:47,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:47:47,446 INFO L85 PathProgramCache]: Analyzing trace with hash 63053744, now seen corresponding path program 1 times [2024-11-12 15:47:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:47:47,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348563339] [2024-11-12 15:47:47,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:47:47,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:47,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:47:47,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:47:47,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 15:47:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:47:47,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 15:47:47,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:47:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:47:47,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:47:47,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:47:47,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348563339] [2024-11-12 15:47:47,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348563339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:47:47,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:47:47,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:47:47,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234204613] [2024-11-12 15:47:47,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:47:47,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 15:47:47,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:47:47,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 15:47:47,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 15:47:47,720 INFO L87 Difference]: Start difference. First operand has 1644 states, 816 states have (on average 2.221813725490196) internal successors, (1813), 1634 states have internal predecessors, (1813), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) 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-11-12 15:47:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:47:47,856 INFO L93 Difference]: Finished difference Result 1624 states and 1717 transitions. [2024-11-12 15:47:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 15:47:47,859 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) 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-11-12 15:47:47,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:47:47,902 INFO L225 Difference]: With dead ends: 1624 [2024-11-12 15:47:47,904 INFO L226 Difference]: Without dead ends: 1622 [2024-11-12 15:47:47,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 15:47:47,916 INFO L435 NwaCegarLoop]: 1717 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:47:47,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:47:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-11-12 15:47:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2024-11-12 15:47:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 806 states have (on average 2.098014888337469) internal successors, (1691), 1612 states have internal predecessors, (1691), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 15:47:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1715 transitions. [2024-11-12 15:47:48,023 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1715 transitions. Word has length 5 [2024-11-12 15:47:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:47:48,023 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 1715 transitions. [2024-11-12 15:47:48,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) 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-11-12 15:47:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1715 transitions. [2024-11-12 15:47:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 15:47:48,024 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:47:48,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 15:47:48,029 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 (2)] Forceful destruction successful, exit code 0 [2024-11-12 15:47:48,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:48,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:47:48,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:47:48,229 INFO L85 PathProgramCache]: Analyzing trace with hash 63053806, now seen corresponding path program 1 times [2024-11-12 15:47:48,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:47:48,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068287219] [2024-11-12 15:47:48,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:47:48,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:48,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:47:48,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:47:48,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 15:47:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:47:48,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:47:48,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:47:48,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 15:47:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:47:48,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:47:48,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:47:48,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068287219] [2024-11-12 15:47:48,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068287219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:47:48,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:47:48,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:47:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672335742] [2024-11-12 15:47:48,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:47:48,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:47:48,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:47:48,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:47:48,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:47:48,441 INFO L87 Difference]: Start difference. First operand 1622 states and 1715 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-11-12 15:47:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:47:50,491 INFO L93 Difference]: Finished difference Result 1758 states and 1883 transitions. [2024-11-12 15:47:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:47:50,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-11-12 15:47:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:47:50,498 INFO L225 Difference]: With dead ends: 1758 [2024-11-12 15:47:50,498 INFO L226 Difference]: Without dead ends: 1758 [2024-11-12 15:47:50,498 INFO L434 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-11-12 15:47:50,499 INFO L435 NwaCegarLoop]: 1181 mSDtfsCounter, 1264 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:47:50,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 1463 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 15:47:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2024-11-12 15:47:50,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1530. [2024-11-12 15:47:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 806 states have (on average 1.9838709677419355) internal successors, (1599), 1520 states have internal predecessors, (1599), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 15:47:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 1623 transitions. [2024-11-12 15:47:50,532 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 1623 transitions. Word has length 5 [2024-11-12 15:47:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:47:50,532 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 1623 transitions. [2024-11-12 15:47:50,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-11-12 15:47:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1623 transitions. [2024-11-12 15:47:50,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 15:47:50,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:47:50,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 15:47:50,537 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-11-12 15:47:50,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:50,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:47:50,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:47:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash 63053807, now seen corresponding path program 1 times [2024-11-12 15:47:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:47:50,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166554977] [2024-11-12 15:47:50,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:47:50,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:50,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:47:50,741 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:47:50,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 15:47:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:47:50,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:47:50,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:47:50,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 15:47:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:47:50,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:47:50,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:47:50,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166554977] [2024-11-12 15:47:50,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166554977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:47:50,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:47:50,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:47:50,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832092234] [2024-11-12 15:47:50,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:47:50,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:47:50,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:47:50,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:47:50,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:47:50,915 INFO L87 Difference]: Start difference. First operand 1530 states and 1623 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-11-12 15:47:53,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:47:53,676 INFO L93 Difference]: Finished difference Result 2076 states and 2220 transitions. [2024-11-12 15:47:53,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:47:53,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-11-12 15:47:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:47:53,683 INFO L225 Difference]: With dead ends: 2076 [2024-11-12 15:47:53,683 INFO L226 Difference]: Without dead ends: 2076 [2024-11-12 15:47:53,683 INFO L434 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-11-12 15:47:53,684 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 768 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:47:53,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 2255 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-12 15:47:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2024-11-12 15:47:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 1697. [2024-11-12 15:47:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 983 states have (on average 1.9521871820956256) internal successors, (1919), 1687 states have internal predecessors, (1919), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 15:47:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 1943 transitions. [2024-11-12 15:47:53,715 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 1943 transitions. Word has length 5 [2024-11-12 15:47:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:47:53,716 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 1943 transitions. [2024-11-12 15:47:53,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-11-12 15:47:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 1943 transitions. [2024-11-12 15:47:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 15:47:53,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:47:53,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 15:47:53,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-12 15:47:53,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:53,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:47:53,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:47:53,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1956327503, now seen corresponding path program 1 times [2024-11-12 15:47:53,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:47:53,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684327467] [2024-11-12 15:47:53,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:47:53,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:53,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:47:53,920 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:47:53,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 15:47:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:47:54,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 15:47:54,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:47:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:47:54,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:47:54,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:47:54,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684327467] [2024-11-12 15:47:54,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684327467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:47:54,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:47:54,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:47:54,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882698282] [2024-11-12 15:47:54,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:47:54,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:47:54,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:47:54,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:47:54,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:47:54,063 INFO L87 Difference]: Start difference. First operand 1697 states and 1943 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:47:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:47:54,176 INFO L93 Difference]: Finished difference Result 3174 states and 3655 transitions. [2024-11-12 15:47:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:47:54,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 15:47:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:47:54,189 INFO L225 Difference]: With dead ends: 3174 [2024-11-12 15:47:54,189 INFO L226 Difference]: Without dead ends: 3174 [2024-11-12 15:47:54,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:47:54,191 INFO L435 NwaCegarLoop]: 1880 mSDtfsCounter, 1357 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:47:54,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 3483 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 15:47:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2024-11-12 15:47:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 1699. [2024-11-12 15:47:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 985 states have (on average 1.950253807106599) internal successors, (1921), 1689 states have internal predecessors, (1921), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 15:47:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 1945 transitions. [2024-11-12 15:47:54,234 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 1945 transitions. Word has length 6 [2024-11-12 15:47:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:47:54,234 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 1945 transitions. [2024-11-12 15:47:54,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:47:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 1945 transitions. [2024-11-12 15:47:54,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 15:47:54,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:47:54,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:47:54,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 15:47:54,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:54,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:47:54,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:47:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash -408167560, now seen corresponding path program 1 times [2024-11-12 15:47:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:47:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961722830] [2024-11-12 15:47:54,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:47:54,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:54,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:47:54,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:47:54,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 15:47:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:47:54,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 15:47:54,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:47:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:47:54,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:47:54,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:47:54,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961722830] [2024-11-12 15:47:54,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961722830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:47:54,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:47:54,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:47:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558670971] [2024-11-12 15:47:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:47:54,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:47:54,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:47:54,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:47:54,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:47:54,648 INFO L87 Difference]: Start difference. First operand 1699 states and 1945 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:47:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:47:54,687 INFO L93 Difference]: Finished difference Result 1657 states and 1902 transitions. [2024-11-12 15:47:54,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:47:54,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 15:47:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:47:54,694 INFO L225 Difference]: With dead ends: 1657 [2024-11-12 15:47:54,694 INFO L226 Difference]: Without dead ends: 1657 [2024-11-12 15:47:54,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:47:54,695 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 71 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:47:54,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3053 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:47:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-11-12 15:47:54,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2024-11-12 15:47:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 967 states have (on average 1.9420889348500516) internal successors, (1878), 1647 states have internal predecessors, (1878), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 15:47:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 1902 transitions. [2024-11-12 15:47:54,724 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 1902 transitions. Word has length 11 [2024-11-12 15:47:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:47:54,724 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 1902 transitions. [2024-11-12 15:47:54,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:47:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 1902 transitions. [2024-11-12 15:47:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 15:47:54,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:47:54,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:47:54,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-12 15:47:54,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:54,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:47:54,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:47:54,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1407004526, now seen corresponding path program 1 times [2024-11-12 15:47:54,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:47:54,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480816629] [2024-11-12 15:47:54,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:47:54,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:54,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:47:54,932 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:47:54,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 15:47:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:47:55,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:47:55,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:47:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:47:55,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:47:55,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:47:55,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480816629] [2024-11-12 15:47:55,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480816629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:47:55,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:47:55,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:47:55,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583968090] [2024-11-12 15:47:55,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:47:55,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:47:55,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:47:55,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:47:55,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:47:55,118 INFO L87 Difference]: Start difference. First operand 1657 states and 1902 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:47:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:47:55,210 INFO L93 Difference]: Finished difference Result 1635 states and 1873 transitions. [2024-11-12 15:47:55,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:47:55,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-12 15:47:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:47:55,216 INFO L225 Difference]: With dead ends: 1635 [2024-11-12 15:47:55,217 INFO L226 Difference]: Without dead ends: 1635 [2024-11-12 15:47:55,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:47:55,219 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 48 mSDsluCounter, 3000 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4513 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:47:55,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4513 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 15:47:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-12 15:47:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2024-11-12 15:47:55,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 959 states have (on average 1.9280500521376434) internal successors, (1849), 1625 states have internal predecessors, (1849), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 15:47:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 1873 transitions. [2024-11-12 15:47:55,250 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 1873 transitions. Word has length 13 [2024-11-12 15:47:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:47:55,252 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 1873 transitions. [2024-11-12 15:47:55,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:47:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1873 transitions. [2024-11-12 15:47:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 15:47:55,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:47:55,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:47:55,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-12 15:47:55,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:55,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:47:55,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:47:55,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1466507840, now seen corresponding path program 1 times [2024-11-12 15:47:55,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:47:55,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716981060] [2024-11-12 15:47:55,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:47:55,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:55,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:47:55,461 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:47:55,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 15:47:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:47:55,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:47:55,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:47:55,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 15:47:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:47:55,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:47:55,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:47:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716981060] [2024-11-12 15:47:55,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716981060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:47:55,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:47:55,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:47:55,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224769508] [2024-11-12 15:47:55,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:47:55,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:47:55,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:47:55,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:47:55,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:47:55,712 INFO L87 Difference]: Start difference. First operand 1635 states and 1873 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:47:57,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:47:57,721 INFO L93 Difference]: Finished difference Result 1635 states and 1873 transitions. [2024-11-12 15:47:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:47:57,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-12 15:47:57,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:47:57,727 INFO L225 Difference]: With dead ends: 1635 [2024-11-12 15:47:57,727 INFO L226 Difference]: Without dead ends: 1635 [2024-11-12 15:47:57,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:47:57,728 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 1201 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:47:57,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1708 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 15:47:57,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-12 15:47:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1631. [2024-11-12 15:47:57,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 959 states have (on average 1.9238790406673618) internal successors, (1845), 1621 states have internal predecessors, (1845), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 15:47:57,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 1869 transitions. [2024-11-12 15:47:57,769 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 1869 transitions. Word has length 27 [2024-11-12 15:47:57,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:47:57,769 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 1869 transitions. [2024-11-12 15:47:57,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:47:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 1869 transitions. [2024-11-12 15:47:57,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 15:47:57,770 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:47:57,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:47:57,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 15:47:57,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:57,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:47:57,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:47:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1466507841, now seen corresponding path program 1 times [2024-11-12 15:47:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:47:57,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786442559] [2024-11-12 15:47:57,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:47:57,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:47:57,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:47:57,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:47:57,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 15:47:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:47:58,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 15:47:58,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:47:58,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 15:47:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:47:58,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:47:58,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:47:58,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786442559] [2024-11-12 15:47:58,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786442559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:47:58,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:47:58,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:47:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801600648] [2024-11-12 15:47:58,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:47:58,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:47:58,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:47:58,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:47:58,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:47:58,320 INFO L87 Difference]: Start difference. First operand 1631 states and 1869 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:48:01,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:48:01,476 INFO L93 Difference]: Finished difference Result 2011 states and 2147 transitions. [2024-11-12 15:48:01,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:48:01,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-12 15:48:01,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:48:01,481 INFO L225 Difference]: With dead ends: 2011 [2024-11-12 15:48:01,482 INFO L226 Difference]: Without dead ends: 2011 [2024-11-12 15:48:01,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:48:01,482 INFO L435 NwaCegarLoop]: 1242 mSDtfsCounter, 701 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:48:01,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2687 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-12 15:48:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2024-11-12 15:48:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1627. [2024-11-12 15:48:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 959 states have (on average 1.9197080291970803) internal successors, (1841), 1617 states have internal predecessors, (1841), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 15:48:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 1865 transitions. [2024-11-12 15:48:01,510 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 1865 transitions. Word has length 27 [2024-11-12 15:48:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:48:01,510 INFO L471 AbstractCegarLoop]: Abstraction has 1627 states and 1865 transitions. [2024-11-12 15:48:01,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:48:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 1865 transitions. [2024-11-12 15:48:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-12 15:48:01,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:48:01,511 INFO L218 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] [2024-11-12 15:48:01,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-12 15:48:01,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:01,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:48:01,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:48:01,713 INFO L85 PathProgramCache]: Analyzing trace with hash 240316858, now seen corresponding path program 1 times [2024-11-12 15:48:01,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:48:01,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074291849] [2024-11-12 15:48:01,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:48:01,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:01,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:48:01,716 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:48:01,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 15:48:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:48:01,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:48:01,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:48:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:01,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:48:01,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:48:01,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074291849] [2024-11-12 15:48:01,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074291849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:48:01,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:48:01,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:48:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455977321] [2024-11-12 15:48:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:48:01,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:48:01,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:48:01,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:48:01,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:48:01,983 INFO L87 Difference]: Start difference. First operand 1627 states and 1865 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:48:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:48:02,054 INFO L93 Difference]: Finished difference Result 1621 states and 1855 transitions. [2024-11-12 15:48:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:48:02,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-11-12 15:48:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:48:02,059 INFO L225 Difference]: With dead ends: 1621 [2024-11-12 15:48:02,059 INFO L226 Difference]: Without dead ends: 1621 [2024-11-12 15:48:02,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:48:02,060 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 21 mSDsluCounter, 2983 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4490 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:48:02,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4490 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:48:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2024-11-12 15:48:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1621. [2024-11-12 15:48:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 953 states have (on average 1.9213011542497376) internal successors, (1831), 1611 states have internal predecessors, (1831), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 15:48:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1855 transitions. [2024-11-12 15:48:02,083 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1855 transitions. Word has length 43 [2024-11-12 15:48:02,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:48:02,084 INFO L471 AbstractCegarLoop]: Abstraction has 1621 states and 1855 transitions. [2024-11-12 15:48:02,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:48:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1855 transitions. [2024-11-12 15:48:02,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 15:48:02,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:48:02,087 INFO L218 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] [2024-11-12 15:48:02,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-12 15:48:02,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:02,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:48:02,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:48:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1088353786, now seen corresponding path program 1 times [2024-11-12 15:48:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:48:02,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103967746] [2024-11-12 15:48:02,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:48:02,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:02,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:48:02,290 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:48:02,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 15:48:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:48:02,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:48:02,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:48:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:02,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:48:02,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:48:02,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103967746] [2024-11-12 15:48:02,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103967746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:48:02,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:48:02,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:48:02,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833290000] [2024-11-12 15:48:02,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:48:02,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:48:02,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:48:02,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:48:02,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:48:02,717 INFO L87 Difference]: Start difference. First operand 1621 states and 1855 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:48:02,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:48:02,833 INFO L93 Difference]: Finished difference Result 1839 states and 2102 transitions. [2024-11-12 15:48:02,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:48:02,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-11-12 15:48:02,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:48:02,839 INFO L225 Difference]: With dead ends: 1839 [2024-11-12 15:48:02,840 INFO L226 Difference]: Without dead ends: 1839 [2024-11-12 15:48:02,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:48:02,840 INFO L435 NwaCegarLoop]: 1594 mSDtfsCounter, 178 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:48:02,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 3051 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 15:48:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2024-11-12 15:48:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1668. [2024-11-12 15:48:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1000 states have (on average 1.878) internal successors, (1878), 1658 states have internal predecessors, (1878), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 15:48:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 1902 transitions. [2024-11-12 15:48:02,863 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 1902 transitions. Word has length 51 [2024-11-12 15:48:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:48:02,863 INFO L471 AbstractCegarLoop]: Abstraction has 1668 states and 1902 transitions. [2024-11-12 15:48:02,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:48:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 1902 transitions. [2024-11-12 15:48:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 15:48:02,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:48:02,865 INFO L218 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] [2024-11-12 15:48:02,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-12 15:48:03,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:03,065 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:48:03,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:48:03,066 INFO L85 PathProgramCache]: Analyzing trace with hash -546976181, now seen corresponding path program 1 times [2024-11-12 15:48:03,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:48:03,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516712821] [2024-11-12 15:48:03,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:48:03,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:03,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:48:03,070 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:48:03,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 15:48:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:48:03,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 15:48:03,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:48:03,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 15:48:03,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 15:48:03,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 15:48:03,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 15:48:03,809 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 15:48:03,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 15:48:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:03,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:48:03,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:48:03,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516712821] [2024-11-12 15:48:03,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516712821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:48:03,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:48:03,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:48:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887913956] [2024-11-12 15:48:03,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:48:03,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:48:03,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:48:03,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:48:03,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:48:03,826 INFO L87 Difference]: Start difference. First operand 1668 states and 1902 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:48:05,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:48:05,892 INFO L93 Difference]: Finished difference Result 1584 states and 1818 transitions. [2024-11-12 15:48:05,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:48:05,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-12 15:48:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:48:05,896 INFO L225 Difference]: With dead ends: 1584 [2024-11-12 15:48:05,896 INFO L226 Difference]: Without dead ends: 1584 [2024-11-12 15:48:05,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:48:05,897 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 1128 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:48:05,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 820 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 15:48:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-11-12 15:48:05,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1407. [2024-11-12 15:48:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 823 states have (on average 1.778857837181045) internal successors, (1464), 1397 states have internal predecessors, (1464), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 15:48:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1488 transitions. [2024-11-12 15:48:05,915 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1488 transitions. Word has length 54 [2024-11-12 15:48:05,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:48:05,916 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1488 transitions. [2024-11-12 15:48:05,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:48:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1488 transitions. [2024-11-12 15:48:05,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 15:48:05,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:48:05,917 INFO L218 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-11-12 15:48:05,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 15:48:06,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:06,118 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:48:06,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:48:06,119 INFO L85 PathProgramCache]: Analyzing trace with hash 206433881, now seen corresponding path program 1 times [2024-11-12 15:48:06,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:48:06,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676930052] [2024-11-12 15:48:06,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:48:06,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:06,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:48:06,120 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:48:06,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 15:48:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:48:06,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 15:48:06,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:48:06,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 15:48:06,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 15:48:06,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 15:48:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:06,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:48:06,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:48:06,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676930052] [2024-11-12 15:48:06,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676930052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:48:06,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:48:06,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:48:06,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490523754] [2024-11-12 15:48:06,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:48:06,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:48:06,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:48:06,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:48:06,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:48:06,407 INFO L87 Difference]: Start difference. First operand 1407 states and 1488 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:48:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:48:08,609 INFO L93 Difference]: Finished difference Result 1406 states and 1487 transitions. [2024-11-12 15:48:08,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:48:08,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-12 15:48:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:48:08,615 INFO L225 Difference]: With dead ends: 1406 [2024-11-12 15:48:08,615 INFO L226 Difference]: Without dead ends: 1406 [2024-11-12 15:48:08,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:48:08,617 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 2 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3707 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:48:08,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3707 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2036 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-12 15:48:08,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-11-12 15:48:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1406. [2024-11-12 15:48:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 823 states have (on average 1.7776427703523694) internal successors, (1463), 1396 states have internal predecessors, (1463), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 15:48:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1487 transitions. [2024-11-12 15:48:08,632 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1487 transitions. Word has length 59 [2024-11-12 15:48:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:48:08,632 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 1487 transitions. [2024-11-12 15:48:08,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:48:08,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1487 transitions. [2024-11-12 15:48:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 15:48:08,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:48:08,633 INFO L218 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-11-12 15:48:08,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 15:48:08,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:08,834 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:48:08,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:48:08,835 INFO L85 PathProgramCache]: Analyzing trace with hash 206433882, now seen corresponding path program 1 times [2024-11-12 15:48:08,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:48:08,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560431821] [2024-11-12 15:48:08,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:48:08,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:08,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:48:08,837 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:48:08,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 15:48:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:48:09,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 15:48:09,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:48:09,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 15:48:09,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 15:48:09,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-12 15:48:09,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 15:48:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:09,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:48:09,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:48:09,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560431821] [2024-11-12 15:48:09,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560431821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:48:09,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:48:09,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:48:09,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103050568] [2024-11-12 15:48:09,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:48:09,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:48:09,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:48:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:48:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:48:09,156 INFO L87 Difference]: Start difference. First operand 1406 states and 1487 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:48:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:48:11,955 INFO L93 Difference]: Finished difference Result 1405 states and 1486 transitions. [2024-11-12 15:48:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:48:11,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-12 15:48:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:48:11,959 INFO L225 Difference]: With dead ends: 1405 [2024-11-12 15:48:11,959 INFO L226 Difference]: Without dead ends: 1405 [2024-11-12 15:48:11,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:48:11,960 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 1 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3745 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-12 15:48:11,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3745 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-12 15:48:11,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-12 15:48:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1405. [2024-11-12 15:48:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 822 states have (on average 1.778588807785888) internal successors, (1462), 1395 states have internal predecessors, (1462), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 15:48:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1486 transitions. [2024-11-12 15:48:11,976 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1486 transitions. Word has length 59 [2024-11-12 15:48:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:48:11,976 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1486 transitions. [2024-11-12 15:48:11,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:48:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1486 transitions. [2024-11-12 15:48:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 15:48:11,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:48:11,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:48:11,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-12 15:48:12,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:12,178 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:48:12,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:48:12,178 INFO L85 PathProgramCache]: Analyzing trace with hash 874646528, now seen corresponding path program 1 times [2024-11-12 15:48:12,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:48:12,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932081578] [2024-11-12 15:48:12,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:48:12,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:12,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:48:12,180 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:48:12,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-12 15:48:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:48:12,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:48:12,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:48:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:12,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:48:12,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:48:12,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932081578] [2024-11-12 15:48:12,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932081578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:48:12,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:48:12,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:48:12,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445226707] [2024-11-12 15:48:12,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:48:12,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:48:12,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:48:12,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:48:12,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:48:12,449 INFO L87 Difference]: Start difference. First operand 1405 states and 1486 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:48:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:48:12,508 INFO L93 Difference]: Finished difference Result 1408 states and 1491 transitions. [2024-11-12 15:48:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:48:12,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 67 [2024-11-12 15:48:12,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:48:12,513 INFO L225 Difference]: With dead ends: 1408 [2024-11-12 15:48:12,514 INFO L226 Difference]: Without dead ends: 1408 [2024-11-12 15:48:12,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:48:12,514 INFO L435 NwaCegarLoop]: 1433 mSDtfsCounter, 0 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4291 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:48:12,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4291 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:48:12,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-11-12 15:48:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1408. [2024-11-12 15:48:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 824 states have (on average 1.7779126213592233) internal successors, (1465), 1398 states have internal predecessors, (1465), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 15:48:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1491 transitions. [2024-11-12 15:48:12,541 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1491 transitions. Word has length 67 [2024-11-12 15:48:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:48:12,541 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 1491 transitions. [2024-11-12 15:48:12,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:48:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1491 transitions. [2024-11-12 15:48:12,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 15:48:12,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:48:12,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:48:12,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-12 15:48:12,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:12,743 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:48:12,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:48:12,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1559238311, now seen corresponding path program 1 times [2024-11-12 15:48:12,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:48:12,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473092800] [2024-11-12 15:48:12,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:48:12,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:12,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:48:12,748 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:48:12,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-12 15:48:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:48:13,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:48:13,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:48:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:13,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:48:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:13,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:48:13,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473092800] [2024-11-12 15:48:13,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473092800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:48:13,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:48:13,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 15:48:13,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264835360] [2024-11-12 15:48:13,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:48:13,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 15:48:13,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:48:13,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 15:48:13,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 15:48:13,143 INFO L87 Difference]: Start difference. First operand 1408 states and 1491 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:48:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:48:13,330 INFO L93 Difference]: Finished difference Result 1420 states and 1509 transitions. [2024-11-12 15:48:13,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 15:48:13,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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 68 [2024-11-12 15:48:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:48:13,335 INFO L225 Difference]: With dead ends: 1420 [2024-11-12 15:48:13,335 INFO L226 Difference]: Without dead ends: 1420 [2024-11-12 15:48:13,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-12 15:48:13,336 INFO L435 NwaCegarLoop]: 1432 mSDtfsCounter, 5 mSDsluCounter, 8555 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9987 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:48:13,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 9987 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 15:48:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-11-12 15:48:13,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1418. [2024-11-12 15:48:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 833 states have (on average 1.7767106842737095) internal successors, (1480), 1407 states have internal predecessors, (1480), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 15:48:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1506 transitions. [2024-11-12 15:48:13,356 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1506 transitions. Word has length 68 [2024-11-12 15:48:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:48:13,357 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 1506 transitions. [2024-11-12 15:48:13,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:48:13,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1506 transitions. [2024-11-12 15:48:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 15:48:13,358 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:48:13,358 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:48:13,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-12 15:48:13,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:13,559 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:48:13,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:48:13,559 INFO L85 PathProgramCache]: Analyzing trace with hash -56427072, now seen corresponding path program 2 times [2024-11-12 15:48:13,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:48:13,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219878639] [2024-11-12 15:48:13,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 15:48:13,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:13,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:48:13,561 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:48:13,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-12 15:48:13,990 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 15:48:13,990 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:48:14,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 15:48:14,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:48:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:14,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:48:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:14,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:48:14,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219878639] [2024-11-12 15:48:14,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219878639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:48:14,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:48:14,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-12 15:48:14,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873753642] [2024-11-12 15:48:14,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:48:14,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 15:48:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:48:14,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 15:48:14,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-12 15:48:14,228 INFO L87 Difference]: Start difference. First operand 1418 states and 1506 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:48:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:48:14,713 INFO L93 Difference]: Finished difference Result 1433 states and 1527 transitions. [2024-11-12 15:48:14,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 15:48:14,714 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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 71 [2024-11-12 15:48:14,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:48:14,719 INFO L225 Difference]: With dead ends: 1433 [2024-11-12 15:48:14,719 INFO L226 Difference]: Without dead ends: 1427 [2024-11-12 15:48:14,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-12 15:48:14,720 INFO L435 NwaCegarLoop]: 1433 mSDtfsCounter, 12 mSDsluCounter, 9992 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 11425 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:48:14,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 11425 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 15:48:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2024-11-12 15:48:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2024-11-12 15:48:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 842 states have (on average 1.7707838479809976) internal successors, (1491), 1416 states have internal predecessors, (1491), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 15:48:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1517 transitions. [2024-11-12 15:48:14,744 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1517 transitions. Word has length 71 [2024-11-12 15:48:14,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:48:14,744 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1517 transitions. [2024-11-12 15:48:14,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:48:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1517 transitions. [2024-11-12 15:48:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 15:48:14,746 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:48:14,749 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:48:14,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-12 15:48:14,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:14,950 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:48:14,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:48:14,950 INFO L85 PathProgramCache]: Analyzing trace with hash -857504672, now seen corresponding path program 3 times [2024-11-12 15:48:14,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:48:14,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067215415] [2024-11-12 15:48:14,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 15:48:14,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:14,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:48:14,952 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:48:14,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-12 15:48:15,538 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-12 15:48:15,538 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:48:15,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 15:48:15,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:48:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:15,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:48:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:16,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:48:16,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067215415] [2024-11-12 15:48:16,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067215415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:48:16,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:48:16,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-12 15:48:16,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129453048] [2024-11-12 15:48:16,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:48:16,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 15:48:16,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:48:16,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 15:48:16,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-12 15:48:16,111 INFO L87 Difference]: Start difference. First operand 1427 states and 1517 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:48:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:48:17,435 INFO L93 Difference]: Finished difference Result 1451 states and 1556 transitions. [2024-11-12 15:48:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-12 15:48:17,436 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2024-11-12 15:48:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:48:17,440 INFO L225 Difference]: With dead ends: 1451 [2024-11-12 15:48:17,440 INFO L226 Difference]: Without dead ends: 1445 [2024-11-12 15:48:17,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 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-11-12 15:48:17,441 INFO L435 NwaCegarLoop]: 1433 mSDtfsCounter, 16 mSDsluCounter, 18566 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 19999 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 15:48:17,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 19999 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 15:48:17,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-11-12 15:48:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2024-11-12 15:48:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 860 states have (on average 1.7604651162790699) internal successors, (1514), 1434 states have internal predecessors, (1514), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 15:48:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1540 transitions. [2024-11-12 15:48:17,457 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1540 transitions. Word has length 77 [2024-11-12 15:48:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:48:17,458 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1540 transitions. [2024-11-12 15:48:17,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:48:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1540 transitions. [2024-11-12 15:48:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 15:48:17,459 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:48:17,459 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:48:17,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-12 15:48:17,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:17,660 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:48:17,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:48:17,660 INFO L85 PathProgramCache]: Analyzing trace with hash 395848096, now seen corresponding path program 4 times [2024-11-12 15:48:17,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:48:17,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86909704] [2024-11-12 15:48:17,661 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 15:48:17,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:17,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:48:17,664 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:48:17,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-12 15:48:18,090 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 15:48:18,090 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:48:18,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 15:48:18,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:48:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:18,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:48:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:48:19,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:48:19,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86909704] [2024-11-12 15:48:19,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86909704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:48:19,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:48:19,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-12 15:48:19,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93589505] [2024-11-12 15:48:19,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:48:19,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 15:48:19,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:48:19,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 15:48:19,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 15:48:19,651 INFO L87 Difference]: Start difference. First operand 1445 states and 1540 transitions. Second operand has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:48:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:48:24,168 INFO L93 Difference]: Finished difference Result 1485 states and 1613 transitions. [2024-11-12 15:48:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-12 15:48:24,170 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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 89 [2024-11-12 15:48:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:48:24,174 INFO L225 Difference]: With dead ends: 1485 [2024-11-12 15:48:24,174 INFO L226 Difference]: Without dead ends: 1481 [2024-11-12 15:48:24,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-12 15:48:24,176 INFO L435 NwaCegarLoop]: 1432 mSDtfsCounter, 43 mSDsluCounter, 37123 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 38555 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:48:24,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 38555 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2036 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 15:48:24,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2024-11-12 15:48:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1479. [2024-11-12 15:48:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 894 states have (on average 1.74496644295302) internal successors, (1560), 1468 states have internal predecessors, (1560), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 15:48:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1586 transitions. [2024-11-12 15:48:24,209 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1586 transitions. Word has length 89 [2024-11-12 15:48:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:48:24,209 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 1586 transitions. [2024-11-12 15:48:24,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:48:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1586 transitions. [2024-11-12 15:48:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 15:48:24,210 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:48:24,210 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:48:24,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-12 15:48:24,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:24,411 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-12 15:48:24,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:48:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1542082368, now seen corresponding path program 5 times [2024-11-12 15:48:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:48:24,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107955749] [2024-11-12 15:48:24,412 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 15:48:24,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:48:24,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:48:24,414 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:48:24,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-12 15:48:25,546 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-12 15:48:25,546 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:48:25,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-12 15:48:25,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:48:25,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 15:48:25,657 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-12 15:48:25,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-12 15:48:25,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 15:48:25,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-12 15:48:26,780 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:48:26,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-12 15:48:26,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-12 15:48:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-12 15:48:26,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:48:27,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:48:27,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107955749] [2024-11-12 15:48:27,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107955749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:48:27,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [524588623] [2024-11-12 15:48:27,173 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 15:48:27,173 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 15:48:27,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 15:48:27,175 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 15:48:27,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process