./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c7c6ca5d 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_BER_nondet_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:13:19,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:13:19,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-09 07:13:19,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:13:19,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:13:19,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:13:19,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:13:19,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:13:19,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:13:19,919 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:13:19,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:13:19,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:13:19,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:13:19,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:13:19,921 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:13:19,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:13:19,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:13:19,922 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:13:19,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:13:19,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:13:19,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:13:19,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:13:19,925 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:13:19,925 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:13:19,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:13:19,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:13:19,926 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:13:19,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:13:19,927 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:13:19,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:13:19,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:13:19,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:13:19,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:13:19,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:13:19,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:13:19,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:13:19,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:13:19,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:13:19,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:13:19,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:13:19,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:13:19,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:13:19,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:13:19,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:13:19,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:13:19,936 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-memcleanup) ) 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-11-09 07:13:20,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:13:20,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:13:20,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:13:20,231 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:13:20,232 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:13:20,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2024-11-09 07:13:21,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:13:22,015 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:13:22,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2024-11-09 07:13:22,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49084b20/e69a0c329d8941338bc92aab03998398/FLAGf20cac76a [2024-11-09 07:13:22,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49084b20/e69a0c329d8941338bc92aab03998398 [2024-11-09 07:13:22,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:13:22,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:13:22,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:13:22,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:13:22,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:13:22,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:13:22" (1/1) ... [2024-11-09 07:13:22,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4f3c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:22, skipping insertion in model container [2024-11-09 07:13:22,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:13:22" (1/1) ... [2024-11-09 07:13:22,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:13:22,827 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-09 07:13:22,883 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-09 07:13:22,887 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-09 07:13:22,903 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-09 07:13:22,917 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-09 07:13:22,964 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-09 07:13:22,968 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-09 07:13:22,971 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-09 07:13:22,971 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-09 07:13:22,980 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-09 07:13:22,983 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-09 07:13:22,987 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-09 07:13:22,988 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-09 07:13:22,994 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-09 07:13:22,995 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-09 07:13:22,998 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-09 07:13:23,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-09 07:13:23,002 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-09 07:13:23,003 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-09 07:13:23,006 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-09 07:13:23,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:13:23,027 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-09 07:13:23,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@71367ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:23, skipping insertion in model container [2024-11-09 07:13:23,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:13:23,029 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:13:23,031 INFO L158 Benchmark]: Toolchain (without parser) took 745.54ms. Allocated memory is still 163.6MB. Free memory was 89.2MB in the beginning and 127.0MB in the end (delta: -37.8MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-09 07:13:23,031 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 163.6MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:13:23,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 743.29ms. Allocated memory is still 163.6MB. Free memory was 89.0MB in the beginning and 127.0MB in the end (delta: -37.9MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-09 07:13:23,033 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.26ms. Allocated memory is still 163.6MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 743.29ms. Allocated memory is still 163.6MB. Free memory was 89.0MB in the beginning and 127.0MB in the end (delta: -37.9MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 750]: 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_BER_nondet_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:13:25,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:13:25,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-09 07:13:25,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:13:25,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:13:25,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:13:25,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:13:25,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:13:25,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:13:25,309 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:13:25,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:13:25,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:13:25,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:13:25,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:13:25,314 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:13:25,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:13:25,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:13:25,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:13:25,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:13:25,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:13:25,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:13:25,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:13:25,317 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:13:25,321 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:13:25,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:13:25,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:13:25,322 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:13:25,322 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:13:25,323 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:13:25,323 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:13:25,323 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:13:25,323 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:13:25,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:13:25,324 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:13:25,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:13:25,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:13:25,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:13:25,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:13:25,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:13:25,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:13:25,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:13:25,328 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:13:25,328 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:13:25,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:13:25,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:13:25,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:13:25,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:13:25,329 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-memcleanup) ) 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-11-09 07:13:25,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:13:25,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:13:25,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:13:25,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:13:25,717 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:13:25,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2024-11-09 07:13:27,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:13:27,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:13:27,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2024-11-09 07:13:27,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1fd3c7e/b572bce818e44f9594490668eab73f03/FLAGa536a46b2 [2024-11-09 07:13:27,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1fd3c7e/b572bce818e44f9594490668eab73f03 [2024-11-09 07:13:27,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:13:27,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:13:27,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:13:27,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:13:27,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:13:27,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:13:27" (1/1) ... [2024-11-09 07:13:27,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f174611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:27, skipping insertion in model container [2024-11-09 07:13:27,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:13:27" (1/1) ... [2024-11-09 07:13:27,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:13:28,307 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-09 07:13:28,348 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-09 07:13:28,371 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-09 07:13:28,376 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-09 07:13:28,388 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-09 07:13:28,442 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-09 07:13:28,442 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-09 07:13:28,444 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-09 07:13:28,448 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-09 07:13:28,454 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-09 07:13:28,455 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-09 07:13:28,460 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-09 07:13:28,461 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-09 07:13:28,465 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-09 07:13:28,470 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-09 07:13:28,472 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-09 07:13:28,473 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-09 07:13:28,474 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-09 07:13:28,475 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-09 07:13:28,481 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-09 07:13:28,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:13:28,515 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:13:28,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:13:28,564 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-09 07:13:28,585 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-09 07:13:28,591 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-09 07:13:28,597 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-09 07:13:28,605 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-09 07:13:28,630 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-09 07:13:28,630 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-09 07:13:28,632 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-09 07:13:28,633 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-09 07:13:28,635 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-09 07:13:28,636 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-09 07:13:28,637 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-09 07:13:28,638 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-09 07:13:28,641 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-09 07:13:28,642 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-09 07:13:28,644 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-09 07:13:28,645 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-09 07:13:28,646 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-09 07:13:28,646 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-09 07:13:28,649 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-09 07:13:28,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:13:28,657 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:13:28,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:13:28,815 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:13:28,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28 WrapperNode [2024-11-09 07:13:28,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:13:28,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:13:28,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:13:28,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:13:28,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28" (1/1) ... [2024-11-09 07:13:28,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28" (1/1) ... [2024-11-09 07:13:28,955 INFO L138 Inliner]: procedures = 180, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1189 [2024-11-09 07:13:28,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:13:28,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:13:28,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:13:28,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:13:28,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28" (1/1) ... [2024-11-09 07:13:28,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28" (1/1) ... [2024-11-09 07:13:28,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28" (1/1) ... [2024-11-09 07:13:29,076 INFO L175 MemorySlicer]: Split 302 memory accesses to 3 slices as follows [2, 266, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-11-09 07:13:29,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28" (1/1) ... [2024-11-09 07:13:29,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28" (1/1) ... [2024-11-09 07:13:29,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28" (1/1) ... [2024-11-09 07:13:29,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28" (1/1) ... [2024-11-09 07:13:29,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28" (1/1) ... [2024-11-09 07:13:29,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28" (1/1) ... [2024-11-09 07:13:29,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:13:29,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:13:29,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:13:29,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:13:29,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28" (1/1) ... [2024-11-09 07:13:29,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:13:29,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:13:29,237 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-09 07:13:29,244 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-09 07:13:29,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 07:13:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 07:13:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 07:13:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 07:13:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 07:13:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 07:13:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 07:13:29,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 07:13:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 07:13:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 07:13:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 07:13:29,290 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 07:13:29,290 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 07:13:29,291 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 07:13:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:13:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:13:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:13:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:13:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:13:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:13:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:13:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:13:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:13:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 07:13:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 07:13:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 07:13:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:13:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 07:13:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 07:13:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 07:13:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:13:29,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:13:29,536 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:13:29,539 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:13:37,181 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-09 07:13:37,182 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:13:37,207 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:13:37,209 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-09 07:13:37,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:13:37 BoogieIcfgContainer [2024-11-09 07:13:37,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:13:37,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:13:37,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:13:37,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:13:37,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:13:27" (1/3) ... [2024-11-09 07:13:37,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37085104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:13:37, skipping insertion in model container [2024-11-09 07:13:37,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:13:28" (2/3) ... [2024-11-09 07:13:37,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37085104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:13:37, skipping insertion in model container [2024-11-09 07:13:37,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:13:37" (3/3) ... [2024-11-09 07:13:37,220 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test3-2.i [2024-11-09 07:13:37,238 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:13:37,238 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:13:37,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:13:37,310 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;@727ef307, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:13:37,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 07:13:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 233 states, 223 states have (on average 1.6591928251121075) internal successors, (370), 226 states have internal predecessors, (370), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:13:37,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:13:37,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:13:37,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:13:37,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:13:37,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:13:37,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1665324, now seen corresponding path program 1 times [2024-11-09 07:13:37,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:13:37,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142023746] [2024-11-09 07:13:37,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:13:37,344 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-09 07:13:37,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:13:37,347 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-09 07:13:37,351 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-09 07:13:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:13:37,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:13:37,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:13:37,633 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_16| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_16| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_16|)))) is different from true [2024-11-09 07:13:37,635 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-09 07:13:37,636 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:13:37,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:13:37,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142023746] [2024-11-09 07:13:37,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142023746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:13:37,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:13:37,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:13:37,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644225592] [2024-11-09 07:13:37,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:13:37,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:13:37,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:13:37,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:13:37,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 07:13:37,679 INFO L87 Difference]: Start difference. First operand has 233 states, 223 states have (on average 1.6591928251121075) internal successors, (370), 226 states have internal predecessors, (370), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:13:41,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:13:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:13:42,542 INFO L93 Difference]: Finished difference Result 356 states and 468 transitions. [2024-11-09 07:13:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:13:42,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:13:42,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:13:42,563 INFO L225 Difference]: With dead ends: 356 [2024-11-09 07:13:42,563 INFO L226 Difference]: Without dead ends: 353 [2024-11-09 07:13:42,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 07:13:42,567 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 157 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 469 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:13:42,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 572 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 1 Unknown, 469 Unchecked, 4.8s Time] [2024-11-09 07:13:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-09 07:13:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 230. [2024-11-09 07:13:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 221 states have (on average 1.3031674208144797) internal successors, (288), 223 states have internal predecessors, (288), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:13:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 298 transitions. [2024-11-09 07:13:42,637 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 298 transitions. Word has length 4 [2024-11-09 07:13:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:13:42,637 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 298 transitions. [2024-11-09 07:13:42,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:13:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 298 transitions. [2024-11-09 07:13:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:13:42,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:13:42,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:13:42,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 07:13:42,840 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-09 07:13:42,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:13:42,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:13:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash 38802630, now seen corresponding path program 1 times [2024-11-09 07:13:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:13:42,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075752896] [2024-11-09 07:13:42,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:13:42,843 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-09 07:13:42,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:13:42,860 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-09 07:13:42,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 07:13:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:13:43,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:13:43,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:13:43,160 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-09 07:13:43,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:13:43,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:13:43,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075752896] [2024-11-09 07:13:43,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075752896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:13:43,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:13:43,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:13:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823466238] [2024-11-09 07:13:43,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:13:43,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:13:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:13:43,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:13:43,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:13:43,165 INFO L87 Difference]: Start difference. First operand 230 states and 298 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:13:47,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:13:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:13:48,939 INFO L93 Difference]: Finished difference Result 377 states and 490 transitions. [2024-11-09 07:13:48,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:13:48,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:13:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:13:48,944 INFO L225 Difference]: With dead ends: 377 [2024-11-09 07:13:48,945 INFO L226 Difference]: Without dead ends: 377 [2024-11-09 07:13:48,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-09 07:13:48,946 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 182 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:13:48,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 834 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2024-11-09 07:13:48,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-09 07:13:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 345. [2024-11-09 07:13:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 335 states have (on average 1.3044776119402985) internal successors, (437), 338 states have internal predecessors, (437), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:13:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 449 transitions. [2024-11-09 07:13:48,974 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 449 transitions. Word has length 15 [2024-11-09 07:13:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:13:48,974 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 449 transitions. [2024-11-09 07:13:48,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:13:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 449 transitions. [2024-11-09 07:13:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:13:48,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:13:48,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:13:48,980 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-09 07:13:49,179 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-09 07:13:49,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:13:49,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:13:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash -952324053, now seen corresponding path program 1 times [2024-11-09 07:13:49,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:13:49,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623792204] [2024-11-09 07:13:49,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:13:49,181 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-09 07:13:49,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:13:49,184 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-09 07:13:49,185 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-09 07:13:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:13:49,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:13:49,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:13:49,623 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_17| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_17| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_17|)))) is different from true [2024-11-09 07:13:49,624 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-09 07:13:49,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:13:49,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:13:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623792204] [2024-11-09 07:13:49,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623792204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:13:49,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:13:49,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:13:49,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512914871] [2024-11-09 07:13:49,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:13:49,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:13:49,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:13:49,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:13:49,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 07:13:49,629 INFO L87 Difference]: Start difference. First operand 345 states and 449 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-09 07:13:53,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:13:55,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:13:55,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:13:55,406 INFO L93 Difference]: Finished difference Result 438 states and 568 transitions. [2024-11-09 07:13:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:13:55,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-09 07:13:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:13:55,418 INFO L225 Difference]: With dead ends: 438 [2024-11-09 07:13:55,418 INFO L226 Difference]: Without dead ends: 430 [2024-11-09 07:13:55,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 07:13:55,419 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 86 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:13:55,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 567 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 1 Unknown, 400 Unchecked, 5.8s Time] [2024-11-09 07:13:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-09 07:13:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 390. [2024-11-09 07:13:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 379 states have (on average 1.3034300791556728) internal successors, (494), 382 states have internal predecessors, (494), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:13:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 508 transitions. [2024-11-09 07:13:55,439 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 508 transitions. Word has length 16 [2024-11-09 07:13:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:13:55,439 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 508 transitions. [2024-11-09 07:13:55,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-09 07:13:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 508 transitions. [2024-11-09 07:13:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 07:13:55,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:13:55,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:13:55,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 07:13:55,645 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-09 07:13:55,646 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:13:55,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:13:55,647 INFO L85 PathProgramCache]: Analyzing trace with hash 22648310, now seen corresponding path program 1 times [2024-11-09 07:13:55,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:13:55,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190244821] [2024-11-09 07:13:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:13:55,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:13:55,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:13:55,651 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-09 07:13:55,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 07:13:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:13:55,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:13:55,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:13:55,865 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-09 07:13:55,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:13:55,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:13:55,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190244821] [2024-11-09 07:13:55,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190244821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:13:55,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:13:55,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:13:55,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417319319] [2024-11-09 07:13:55,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:13:55,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:13:55,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:13:55,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:13:55,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:13:55,868 INFO L87 Difference]: Start difference. First operand 390 states and 508 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:13:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:13:56,039 INFO L93 Difference]: Finished difference Result 399 states and 493 transitions. [2024-11-09 07:13:56,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:13:56,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-09 07:13:56,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:13:56,061 INFO L225 Difference]: With dead ends: 399 [2024-11-09 07:13:56,062 INFO L226 Difference]: Without dead ends: 399 [2024-11-09 07:13:56,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-09 07:13:56,063 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 30 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:13:56,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 785 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:13:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-09 07:13:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2024-11-09 07:13:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 388 states have (on average 1.2345360824742269) internal successors, (479), 391 states have internal predecessors, (479), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:13:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 493 transitions. [2024-11-09 07:13:56,082 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 493 transitions. Word has length 51 [2024-11-09 07:13:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:13:56,083 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 493 transitions. [2024-11-09 07:13:56,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:13:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 493 transitions. [2024-11-09 07:13:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 07:13:56,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:13:56,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:13:56,095 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-09 07:13:56,287 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-09 07:13:56,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:13:56,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:13:56,288 INFO L85 PathProgramCache]: Analyzing trace with hash 437825002, now seen corresponding path program 1 times [2024-11-09 07:13:56,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:13:56,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749039329] [2024-11-09 07:13:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:13:56,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-09 07:13:56,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:13:56,290 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-09 07:13:56,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 (6)] Waiting until timeout for monitored process [2024-11-09 07:13:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:13:56,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:13:56,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:13:56,520 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:13:56,525 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:13:56,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:13:56,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-09 07:13:56,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:13:56,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-09 07:13:56,744 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-09 07:13:56,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:13:56,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:13:56,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749039329] [2024-11-09 07:13:56,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749039329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:13:56,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:13:56,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:13:56,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206773768] [2024-11-09 07:13:56,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:13:56,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:13:56,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:13:56,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:13:56,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:13:56,750 INFO L87 Difference]: Start difference. First operand 399 states and 493 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:13:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:13:57,366 INFO L93 Difference]: Finished difference Result 400 states and 500 transitions. [2024-11-09 07:13:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:13:57,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-09 07:13:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:13:57,369 INFO L225 Difference]: With dead ends: 400 [2024-11-09 07:13:57,369 INFO L226 Difference]: Without dead ends: 397 [2024-11-09 07:13:57,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:13:57,371 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 108 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:13:57,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1094 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:13:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-09 07:13:57,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 350. [2024-11-09 07:13:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 340 states have (on average 1.25) internal successors, (425), 343 states have internal predecessors, (425), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:13:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 437 transitions. [2024-11-09 07:13:57,381 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 437 transitions. Word has length 51 [2024-11-09 07:13:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:13:57,382 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 437 transitions. [2024-11-09 07:13:57,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:13:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 437 transitions. [2024-11-09 07:13:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 07:13:57,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:13:57,385 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:13:57,393 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-09 07:13:57,585 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-09 07:13:57,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:13:57,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:13:57,595 INFO L85 PathProgramCache]: Analyzing trace with hash -457567329, now seen corresponding path program 1 times [2024-11-09 07:13:57,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:13:57,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121396616] [2024-11-09 07:13:57,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:13:57,596 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-09 07:13:57,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:13:57,600 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-09 07:13:57,602 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-09 07:13:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:13:58,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:13:58,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:13:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:13:58,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:13:58,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:13:58,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121396616] [2024-11-09 07:13:58,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121396616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:13:58,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:13:58,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:13:58,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288961822] [2024-11-09 07:13:58,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:13:58,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:13:58,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:13:58,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:13:58,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:13:58,099 INFO L87 Difference]: Start difference. First operand 350 states and 437 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:13:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:13:58,240 INFO L93 Difference]: Finished difference Result 356 states and 427 transitions. [2024-11-09 07:13:58,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:13:58,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-11-09 07:13:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:13:58,242 INFO L225 Difference]: With dead ends: 356 [2024-11-09 07:13:58,245 INFO L226 Difference]: Without dead ends: 356 [2024-11-09 07:13:58,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 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-09 07:13:58,246 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 33 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:13:58,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 749 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:13:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-09 07:13:58,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-11-09 07:13:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 346 states have (on average 1.199421965317919) internal successors, (415), 349 states have internal predecessors, (415), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:13:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 427 transitions. [2024-11-09 07:13:58,257 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 427 transitions. Word has length 86 [2024-11-09 07:13:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:13:58,260 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 427 transitions. [2024-11-09 07:13:58,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:13:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 427 transitions. [2024-11-09 07:13:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 07:13:58,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:13:58,262 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:13:58,274 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-09 07:13:58,463 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-09 07:13:58,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:13:58,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:13:58,464 INFO L85 PathProgramCache]: Analyzing trace with hash -193308145, now seen corresponding path program 1 times [2024-11-09 07:13:58,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:13:58,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929348224] [2024-11-09 07:13:58,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:13:58,465 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-09 07:13:58,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:13:58,468 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-09 07:13:58,469 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-09 07:13:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:13:58,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:13:58,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:13:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:13:59,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:13:59,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:13:59,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929348224] [2024-11-09 07:13:59,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929348224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:13:59,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:13:59,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:13:59,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396053211] [2024-11-09 07:13:59,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:13:59,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:13:59,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:13:59,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:13:59,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:13:59,015 INFO L87 Difference]: Start difference. First operand 356 states and 427 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:13:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:13:59,101 INFO L93 Difference]: Finished difference Result 344 states and 407 transitions. [2024-11-09 07:13:59,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:13:59,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-11-09 07:13:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:13:59,103 INFO L225 Difference]: With dead ends: 344 [2024-11-09 07:13:59,104 INFO L226 Difference]: Without dead ends: 344 [2024-11-09 07:13:59,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:13:59,105 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 6 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:13:59,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 749 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:13:59,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-09 07:13:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2024-11-09 07:13:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 334 states have (on average 1.1826347305389222) internal successors, (395), 337 states have internal predecessors, (395), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:13:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 407 transitions. [2024-11-09 07:13:59,114 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 407 transitions. Word has length 86 [2024-11-09 07:13:59,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:13:59,115 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 407 transitions. [2024-11-09 07:13:59,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:13:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 407 transitions. [2024-11-09 07:13:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 07:13:59,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:13:59,117 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:13:59,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:13:59,317 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-09 07:13:59,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:13:59,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:13:59,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1543730987, now seen corresponding path program 1 times [2024-11-09 07:13:59,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:13:59,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558656116] [2024-11-09 07:13:59,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:13:59,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:13:59,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:13:59,321 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-09 07:13:59,321 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-09 07:13:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:13:59,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:13:59,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:13:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:13:59,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:13:59,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:13:59,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558656116] [2024-11-09 07:13:59,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558656116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:13:59,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:13:59,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:13:59,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902107612] [2024-11-09 07:13:59,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:13:59,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:13:59,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:13:59,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:13:59,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:13:59,845 INFO L87 Difference]: Start difference. First operand 344 states and 407 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:13:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:13:59,903 INFO L93 Difference]: Finished difference Result 347 states and 411 transitions. [2024-11-09 07:13:59,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:13:59,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-09 07:13:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:13:59,907 INFO L225 Difference]: With dead ends: 347 [2024-11-09 07:13:59,907 INFO L226 Difference]: Without dead ends: 347 [2024-11-09 07:13:59,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 83 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-09 07:13:59,909 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:13:59,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 803 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:13:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-09 07:13:59,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-11-09 07:13:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 336 states have (on average 1.1845238095238095) internal successors, (398), 340 states have internal predecessors, (398), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 07:13:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 411 transitions. [2024-11-09 07:13:59,922 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 411 transitions. Word has length 86 [2024-11-09 07:13:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:13:59,922 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 411 transitions. [2024-11-09 07:13:59,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:13:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 411 transitions. [2024-11-09 07:13:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 07:13:59,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:13:59,924 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:13:59,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 07:14:00,124 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-09 07:14:00,125 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:14:00,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:14:00,125 INFO L85 PathProgramCache]: Analyzing trace with hash -525748553, now seen corresponding path program 1 times [2024-11-09 07:14:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:14:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980276429] [2024-11-09 07:14:00,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:14:00,126 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-09 07:14:00,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:14:00,128 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-09 07:14:00,129 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-09 07:14:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:14:00,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:14:00,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:14:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:14:00,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:14:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:14:00,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:14:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980276429] [2024-11-09 07:14:00,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980276429] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:14:00,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:14:00,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 07:14:00,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810403223] [2024-11-09 07:14:00,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:14:00,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:14:00,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:14:00,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:14:00,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:14:00,759 INFO L87 Difference]: Start difference. First operand 347 states and 411 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:14:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:14:01,006 INFO L93 Difference]: Finished difference Result 358 states and 427 transitions. [2024-11-09 07:14:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:14:01,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 88 [2024-11-09 07:14:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:14:01,012 INFO L225 Difference]: With dead ends: 358 [2024-11-09 07:14:01,012 INFO L226 Difference]: Without dead ends: 358 [2024-11-09 07:14:01,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 168 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-09 07:14:01,013 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 5 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:14:01,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1334 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:14:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-09 07:14:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2024-11-09 07:14:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 344 states have (on average 1.197674418604651) internal successors, (412), 348 states have internal predecessors, (412), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 07:14:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 425 transitions. [2024-11-09 07:14:01,025 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 425 transitions. Word has length 88 [2024-11-09 07:14:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:14:01,026 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 425 transitions. [2024-11-09 07:14:01,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:14:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 425 transitions. [2024-11-09 07:14:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 07:14:01,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:14:01,028 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:14:01,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 07:14:01,228 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-09 07:14:01,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:14:01,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:14:01,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1442331605, now seen corresponding path program 2 times [2024-11-09 07:14:01,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:14:01,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999656399] [2024-11-09 07:14:01,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:14:01,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-09 07:14:01,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:14:01,233 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-09 07:14:01,234 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-09 07:14:01,820 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:14:01,820 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:14:01,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:14:01,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:14:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:14:01,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:14:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:14:02,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:14:02,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999656399] [2024-11-09 07:14:02,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999656399] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:14:02,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:14:02,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 07:14:02,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613363827] [2024-11-09 07:14:02,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:14:02,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:14:02,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:14:02,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:14:02,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:14:02,200 INFO L87 Difference]: Start difference. First operand 356 states and 425 transitions. Second operand has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:14:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:14:03,006 INFO L93 Difference]: Finished difference Result 371 states and 447 transitions. [2024-11-09 07:14:03,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:14:03,008 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 92 [2024-11-09 07:14:03,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:14:03,010 INFO L225 Difference]: With dead ends: 371 [2024-11-09 07:14:03,010 INFO L226 Difference]: Without dead ends: 367 [2024-11-09 07:14:03,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:14:03,011 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 8 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:14:03,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2135 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:14:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-09 07:14:03,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2024-11-09 07:14:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 353 states have (on average 1.2011331444759208) internal successors, (424), 357 states have internal predecessors, (424), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 07:14:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 437 transitions. [2024-11-09 07:14:03,023 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 437 transitions. Word has length 92 [2024-11-09 07:14:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:14:03,023 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 437 transitions. [2024-11-09 07:14:03,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:14:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 437 transitions. [2024-11-09 07:14:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 07:14:03,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:14:03,025 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:14:03,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:14:03,225 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-09 07:14:03,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:14:03,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:14:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash -332065783, now seen corresponding path program 3 times [2024-11-09 07:14:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:14:03,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129563184] [2024-11-09 07:14:03,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:14:03,228 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-09 07:14:03,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:14:03,231 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-09 07:14:03,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 07:14:03,757 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 07:14:03,758 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:14:03,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:14:03,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:14:04,229 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:14:04,230 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:14:04,230 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:14:04,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-09 07:14:04,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:14:04,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-09 07:14:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-09 07:14:04,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:14:04,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:14:04,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129563184] [2024-11-09 07:14:04,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129563184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:14:04,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:14:04,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:14:04,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854780278] [2024-11-09 07:14:04,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:14:04,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:14:04,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:14:04,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:14:04,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:14:04,386 INFO L87 Difference]: Start difference. First operand 365 states and 437 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:14:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:14:04,711 INFO L93 Difference]: Finished difference Result 482 states and 585 transitions. [2024-11-09 07:14:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:14:04,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2024-11-09 07:14:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:14:04,715 INFO L225 Difference]: With dead ends: 482 [2024-11-09 07:14:04,715 INFO L226 Difference]: Without dead ends: 482 [2024-11-09 07:14:04,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:14:04,715 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 575 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:14:04,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 704 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:14:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-09 07:14:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 367. [2024-11-09 07:14:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 355 states have (on average 1.2) internal successors, (426), 359 states have internal predecessors, (426), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 07:14:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 439 transitions. [2024-11-09 07:14:04,724 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 439 transitions. Word has length 101 [2024-11-09 07:14:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:14:04,725 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 439 transitions. [2024-11-09 07:14:04,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:14:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 439 transitions. [2024-11-09 07:14:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 07:14:04,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:14:04,726 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:14:04,739 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-09 07:14:04,930 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-09 07:14:04,931 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:14:04,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:14:04,931 INFO L85 PathProgramCache]: Analyzing trace with hash 848725933, now seen corresponding path program 1 times [2024-11-09 07:14:04,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:14:04,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568963488] [2024-11-09 07:14:04,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:14:04,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:14:04,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:14:04,933 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-09 07:14:04,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 07:14:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:14:05,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:14:05,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:14:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:14:05,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:14:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 07:14:06,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:14:06,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568963488] [2024-11-09 07:14:06,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568963488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:14:06,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:14:06,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 07:14:06,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444566287] [2024-11-09 07:14:06,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:14:06,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:14:06,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:14:06,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:14:06,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:14:06,484 INFO L87 Difference]: Start difference. First operand 367 states and 439 transitions. Second operand has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:14:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:14:08,165 INFO L93 Difference]: Finished difference Result 391 states and 479 transitions. [2024-11-09 07:14:08,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 07:14:08,166 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 137 [2024-11-09 07:14:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:14:08,168 INFO L225 Difference]: With dead ends: 391 [2024-11-09 07:14:08,168 INFO L226 Difference]: Without dead ends: 387 [2024-11-09 07:14:08,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 07:14:08,170 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 14 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:14:08,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3473 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:14:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-09 07:14:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2024-11-09 07:14:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 377 states have internal predecessors, (450), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 07:14:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 463 transitions. [2024-11-09 07:14:08,178 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 463 transitions. Word has length 137 [2024-11-09 07:14:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:14:08,179 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 463 transitions. [2024-11-09 07:14:08,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:14:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 463 transitions. [2024-11-09 07:14:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 07:14:08,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:14:08,181 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:14:08,197 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-09 07:14:08,381 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-09 07:14:08,382 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:14:08,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:14:08,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1501707949, now seen corresponding path program 2 times [2024-11-09 07:14:08,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:14:08,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903738823] [2024-11-09 07:14:08,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:14:08,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:14:08,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:14:08,387 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-09 07:14:08,388 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-09 07:14:09,107 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:14:09,107 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:14:09,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:14:09,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:14:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 07:14:09,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:14:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-09 07:14:11,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:14:11,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903738823] [2024-11-09 07:14:11,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903738823] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:14:11,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:14:11,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 07:14:11,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502491145] [2024-11-09 07:14:11,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:14:11,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 07:14:11,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:14:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 07:14:11,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 07:14:11,255 INFO L87 Difference]: Start difference. First operand 385 states and 463 transitions. Second operand has 50 states, 50 states have (on average 3.38) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:14:18,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:14:18,086 INFO L93 Difference]: Finished difference Result 425 states and 535 transitions. [2024-11-09 07:14:18,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 07:14:18,087 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.38) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 155 [2024-11-09 07:14:18,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:14:18,089 INFO L225 Difference]: With dead ends: 425 [2024-11-09 07:14:18,089 INFO L226 Difference]: Without dead ends: 421 [2024-11-09 07:14:18,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 07:14:18,092 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 26 mSDsluCounter, 6145 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6414 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:14:18,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6414 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 07:14:18,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-09 07:14:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 419. [2024-11-09 07:14:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 407 states have (on average 1.2186732186732188) internal successors, (496), 411 states have internal predecessors, (496), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 07:14:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 509 transitions. [2024-11-09 07:14:18,102 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 509 transitions. Word has length 155 [2024-11-09 07:14:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:14:18,103 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 509 transitions. [2024-11-09 07:14:18,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.38) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:14:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 509 transitions. [2024-11-09 07:14:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-09 07:14:18,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:14:18,106 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:14:18,128 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-09 07:14:18,306 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-09 07:14:18,307 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:14:18,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:14:18,308 INFO L85 PathProgramCache]: Analyzing trace with hash -475787539, now seen corresponding path program 3 times [2024-11-09 07:14:18,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:14:18,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309530812] [2024-11-09 07:14:18,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:14:18,309 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-09 07:14:18,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:14:18,310 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-09 07:14:18,312 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-09 07:14:18,912 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 07:14:18,913 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:14:18,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:14:18,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:14:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2024-11-09 07:14:19,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:14:19,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:14:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309530812] [2024-11-09 07:14:19,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309530812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:14:19,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:14:19,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:14:19,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136133382] [2024-11-09 07:14:19,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:14:19,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:14:19,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:14:19,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:14:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:14:19,349 INFO L87 Difference]: Start difference. First operand 419 states and 509 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:14:23,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:14:27,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:14:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:14:29,832 INFO L93 Difference]: Finished difference Result 590 states and 724 transitions. [2024-11-09 07:14:29,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:14:29,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 189 [2024-11-09 07:14:29,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:14:29,837 INFO L225 Difference]: With dead ends: 590 [2024-11-09 07:14:29,837 INFO L226 Difference]: Without dead ends: 590 [2024-11-09 07:14:29,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 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-09 07:14:29,838 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 520 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:14:29,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 580 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2024-11-09 07:14:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-09 07:14:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 516. [2024-11-09 07:14:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 502 states have (on average 1.2171314741035857) internal successors, (611), 507 states have internal predecessors, (611), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 07:14:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 628 transitions. [2024-11-09 07:14:29,855 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 628 transitions. Word has length 189 [2024-11-09 07:14:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:14:29,856 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 628 transitions. [2024-11-09 07:14:29,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:14:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 628 transitions. [2024-11-09 07:14:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-09 07:14:29,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:14:29,858 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:14:29,873 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-09 07:14:30,059 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-09 07:14:30,060 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:14:30,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:14:30,060 INFO L85 PathProgramCache]: Analyzing trace with hash -143902665, now seen corresponding path program 1 times [2024-11-09 07:14:30,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:14:30,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58442382] [2024-11-09 07:14:30,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:14:30,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:14:30,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:14:30,065 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-09 07:14:30,066 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-09 07:14:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:14:31,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:14:31,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:14:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-09 07:14:31,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:14:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-09 07:14:33,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:14:33,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58442382] [2024-11-09 07:14:33,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58442382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:14:33,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:14:33,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-09 07:14:33,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153032451] [2024-11-09 07:14:33,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:14:33,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 07:14:33,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:14:33,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 07:14:33,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 07:14:33,973 INFO L87 Difference]: Start difference. First operand 516 states and 628 transitions. Second operand has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:14:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:14:42,708 INFO L93 Difference]: Finished difference Result 545 states and 682 transitions. [2024-11-09 07:14:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-09 07:14:42,709 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 197 [2024-11-09 07:14:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:14:42,711 INFO L225 Difference]: With dead ends: 545 [2024-11-09 07:14:42,711 INFO L226 Difference]: Without dead ends: 545 [2024-11-09 07:14:42,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-09 07:14:42,714 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 27 mSDsluCounter, 6387 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6655 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:14:42,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6655 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 07:14:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-09 07:14:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 541. [2024-11-09 07:14:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 527 states have (on average 1.25426944971537) internal successors, (661), 532 states have internal predecessors, (661), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 07:14:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 678 transitions. [2024-11-09 07:14:42,730 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 678 transitions. Word has length 197 [2024-11-09 07:14:42,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:14:42,731 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 678 transitions. [2024-11-09 07:14:42,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:14:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 678 transitions. [2024-11-09 07:14:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 07:14:42,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:14:42,733 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:14:42,759 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-09 07:14:42,934 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-09 07:14:42,934 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:14:42,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:14:42,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1115656515, now seen corresponding path program 2 times [2024-11-09 07:14:42,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:14:42,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122116357] [2024-11-09 07:14:42,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:14:42,936 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-09 07:14:42,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:14:42,937 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-09 07:14:42,938 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-09 07:14:44,958 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:14:44,959 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:14:45,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 07:14:45,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:14:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-09 07:14:46,878 INFO L311 TraceCheckSpWp]: Computing backward predicates...