./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-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 ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:14:53,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:14:53,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-22 18:14:53,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:14:53,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:14:53,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:14:53,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:14:53,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:14:53,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:14:53,255 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:14:53,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:14:53,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:14:53,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:14:53,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:14:53,257 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:14:53,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:14:53,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 18:14:53,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:14:53,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:14:53,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:14:53,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:14:53,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 18:14:53,264 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:14:53,264 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:14:53,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:14:53,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 18:14:53,264 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:14:53,264 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:14:53,265 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:14:53,265 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:14:53,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 18:14:53,265 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:14:53,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:14:53,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:14:53,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:14:53,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:14:53,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:14:53,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:14:53,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:14:53,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:14:53,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:14:53,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:14:53,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:14:53,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:14:53,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:14:53,268 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 -> ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 [2024-11-22 18:14:53,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:14:53,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:14:53,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:14:53,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:14:53,469 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:14:53,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2024-11-22 18:14:54,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:14:54,984 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:14:54,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2024-11-22 18:14:54,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4b99b30/4a98a2b54cb4496085ea641984d55320/FLAG0e3e2644e [2024-11-22 18:14:55,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4b99b30/4a98a2b54cb4496085ea641984d55320 [2024-11-22 18:14:55,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:14:55,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:14:55,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:14:55,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:14:55,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:14:55,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:14:55" (1/1) ... [2024-11-22 18:14:55,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24dc5d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:14:55, skipping insertion in model container [2024-11-22 18:14:55,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:14:55" (1/1) ... [2024-11-22 18:14:55,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:14:55,658 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-22 18:14:55,681 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-22 18:14:55,684 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-22 18:14:55,686 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-22 18:14:55,691 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:14:55,714 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-22 18:14:55,714 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-22 18:14:55,716 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-22 18:14:55,716 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-22 18:14:55,718 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-22 18:14:55,719 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-22 18:14:55,720 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-22 18:14:55,721 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-22 18:14:55,723 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-22 18:14:55,724 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-22 18:14:55,725 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:14:55,726 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-22 18:14:55,727 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:14:55,727 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:14:55,730 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:14:55,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:14:55,745 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-22 18:14:55,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@381d43d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:14:55, skipping insertion in model container [2024-11-22 18:14:55,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:14:55,745 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 18:14:55,747 INFO L158 Benchmark]: Toolchain (without parser) took 402.48ms. Allocated memory is still 176.2MB. Free memory was 104.9MB in the beginning and 80.6MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-22 18:14:55,747 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:14:55,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.61ms. Allocated memory is still 176.2MB. Free memory was 104.7MB in the beginning and 80.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-22 18:14:55,749 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.16ms. Allocated memory is still 121.6MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.61ms. Allocated memory is still 176.2MB. Free memory was 104.7MB in the beginning and 80.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-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 ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:14:57,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:14:57,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-22 18:14:57,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:14:57,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:14:57,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:14:57,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:14:57,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:14:57,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:14:57,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:14:57,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:14:57,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:14:57,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:14:57,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:14:57,638 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:14:57,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:14:57,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 18:14:57,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:14:57,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:14:57,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:14:57,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:14:57,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 18:14:57,641 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:14:57,642 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:14:57,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:14:57,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 18:14:57,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:14:57,642 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 18:14:57,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:14:57,642 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 18:14:57,643 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:14:57,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:14:57,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 18:14:57,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:14:57,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:14:57,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:14:57,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:14:57,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:14:57,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:14:57,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:14:57,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:14:57,648 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 18:14:57,648 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 18:14:57,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:14:57,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:14:57,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:14:57,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:14:57,649 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 -> ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 [2024-11-22 18:14:57,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:14:57,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:14:57,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:14:57,960 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:14:57,961 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:14:57,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2024-11-22 18:14:59,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:14:59,522 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:14:59,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2024-11-22 18:14:59,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7bf00cf3/64593ca2945f47a6b54225599000877c/FLAGbc1a62121 [2024-11-22 18:14:59,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7bf00cf3/64593ca2945f47a6b54225599000877c [2024-11-22 18:14:59,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:14:59,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:14:59,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:14:59,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:14:59,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:14:59,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:14:59" (1/1) ... [2024-11-22 18:14:59,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5db9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:14:59, skipping insertion in model container [2024-11-22 18:14:59,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:14:59" (1/1) ... [2024-11-22 18:14:59,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:14:59,844 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-22 18:14:59,863 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-22 18:14:59,866 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:14:59,870 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-22 18:14:59,882 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-22 18:14:59,923 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-22 18:14:59,923 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-22 18:14:59,925 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:14:59,928 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:14:59,930 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:14:59,934 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:14:59,937 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-22 18:14:59,938 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-22 18:14:59,943 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-22 18:14:59,944 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-22 18:14:59,946 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-22 18:14:59,950 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-22 18:14:59,951 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-22 18:14:59,951 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-22 18:14:59,958 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-22 18:14:59,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:14:59,987 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 18:14:59,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:15:00,025 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-22 18:15:00,049 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-22 18:15:00,054 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-22 18:15:00,056 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-22 18:15:00,063 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-22 18:15:00,088 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-22 18:15:00,089 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-22 18:15:00,091 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:15:00,094 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:15:00,096 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-22 18:15:00,097 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-22 18:15:00,097 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-22 18:15:00,098 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:15:00,103 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-22 18:15:00,105 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:15:00,107 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-22 18:15:00,107 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-22 18:15:00,108 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-22 18:15:00,109 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:15:00,116 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-22 18:15:00,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:15:00,126 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:15:00,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:15:00,240 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:15:00,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00 WrapperNode [2024-11-22 18:15:00,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:15:00,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:15:00,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:15:00,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:15:00,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00" (1/1) ... [2024-11-22 18:15:00,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00" (1/1) ... [2024-11-22 18:15:00,345 INFO L138 Inliner]: procedures = 179, calls = 323, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1176 [2024-11-22 18:15:00,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:15:00,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:15:00,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:15:00,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:15:00,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00" (1/1) ... [2024-11-22 18:15:00,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00" (1/1) ... [2024-11-22 18:15:00,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00" (1/1) ... [2024-11-22 18:15:00,456 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 265, 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-22 18:15:00,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00" (1/1) ... [2024-11-22 18:15:00,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00" (1/1) ... [2024-11-22 18:15:00,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00" (1/1) ... [2024-11-22 18:15:00,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00" (1/1) ... [2024-11-22 18:15:00,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00" (1/1) ... [2024-11-22 18:15:00,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00" (1/1) ... [2024-11-22 18:15:00,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:15:00,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:15:00,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:15:00,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:15:00,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00" (1/1) ... [2024-11-22 18:15:00,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:15:00,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:15:00,581 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-22 18:15:00,584 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-22 18:15:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-22 18:15:00,626 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-22 18:15:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 18:15:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 18:15:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 18:15:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 18:15:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 18:15:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 18:15:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-22 18:15:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-22 18:15:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-22 18:15:00,628 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-22 18:15:00,628 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-22 18:15:00,628 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-22 18:15:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:15:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:15:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:15:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:15:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 18:15:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 18:15:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:15:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:15:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 18:15:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:15:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 18:15:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 18:15:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 18:15:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 18:15:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 18:15:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 18:15:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:15:00,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:15:00,819 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:15:00,821 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:15:08,284 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-22 18:15:08,284 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:15:08,313 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:15:08,314 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-22 18:15:08,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:15:08 BoogieIcfgContainer [2024-11-22 18:15:08,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:15:08,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:15:08,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:15:08,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:15:08,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:14:59" (1/3) ... [2024-11-22 18:15:08,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bf4915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:15:08, skipping insertion in model container [2024-11-22 18:15:08,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:15:00" (2/3) ... [2024-11-22 18:15:08,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bf4915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:15:08, skipping insertion in model container [2024-11-22 18:15:08,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:15:08" (3/3) ... [2024-11-22 18:15:08,321 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-2.i [2024-11-22 18:15:08,333 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:15:08,334 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 18:15:08,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:15:08,377 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;@3d07199d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:15:08,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-22 18:15:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 218 states have (on average 1.665137614678899) internal successors, (363), 221 states have internal predecessors, (363), 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-22 18:15:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:15:08,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:08,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:15:08,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:08,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash -718902403, now seen corresponding path program 1 times [2024-11-22 18:15:08,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:08,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585750010] [2024-11-22 18:15:08,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:15:08,402 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-22 18:15:08,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:08,408 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-22 18:15:08,431 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-22 18:15:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:15:08,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 18:15:08,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:08,585 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-22 18:15:08,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:15:08,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:08,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585750010] [2024-11-22 18:15:08,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585750010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:15:08,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:15:08,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:15:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414299537] [2024-11-22 18:15:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:15:08,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 18:15:08,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:08,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 18:15:08,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 18:15:08,639 INFO L87 Difference]: Start difference. First operand has 228 states, 218 states have (on average 1.665137614678899) internal successors, (363), 221 states have internal predecessors, (363), 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 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-22 18:15:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:15:08,662 INFO L93 Difference]: Finished difference Result 225 states and 291 transitions. [2024-11-22 18:15:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 18:15:08,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2024-11-22 18:15:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:15:08,671 INFO L225 Difference]: With dead ends: 225 [2024-11-22 18:15:08,671 INFO L226 Difference]: Without dead ends: 223 [2024-11-22 18:15:08,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 18:15:08,675 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:15:08,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:15:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-22 18:15:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-11-22 18:15:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 215 states have (on average 1.3069767441860465) internal successors, (281), 217 states have internal predecessors, (281), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:15:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 289 transitions. [2024-11-22 18:15:08,725 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 289 transitions. Word has length 10 [2024-11-22 18:15:08,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:15:08,725 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 289 transitions. [2024-11-22 18:15:08,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-22 18:15:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 289 transitions. [2024-11-22 18:15:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:15:08,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:08,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:15:08,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 18:15:08,927 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-22 18:15:08,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:08,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1957560088, now seen corresponding path program 1 times [2024-11-22 18:15:08,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:08,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429514446] [2024-11-22 18:15:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:15:08,928 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-22 18:15:08,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:08,931 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-22 18:15:08,933 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-22 18:15:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:15:09,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:15:09,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:09,138 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-22 18:15:09,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:15:09,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:09,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429514446] [2024-11-22 18:15:09,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429514446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:15:09,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:15:09,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:15:09,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309301304] [2024-11-22 18:15:09,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:15:09,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:15:09,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:09,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:15:09,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:15:09,142 INFO L87 Difference]: Start difference. First operand 223 states and 289 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-22 18:15:13,403 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-22 18:15:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:15:15,545 INFO L93 Difference]: Finished difference Result 370 states and 480 transitions. [2024-11-22 18:15:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:15:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 12 [2024-11-22 18:15:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:15:15,548 INFO L225 Difference]: With dead ends: 370 [2024-11-22 18:15:15,548 INFO L226 Difference]: Without dead ends: 370 [2024-11-22 18:15:15,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:15:15,549 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 182 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:15:15,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 809 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2024-11-22 18:15:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-22 18:15:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 337. [2024-11-22 18:15:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 329 states have (on average 1.3069908814589666) internal successors, (430), 331 states have internal predecessors, (430), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:15:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 438 transitions. [2024-11-22 18:15:15,568 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 438 transitions. Word has length 12 [2024-11-22 18:15:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:15:15,568 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 438 transitions. [2024-11-22 18:15:15,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-22 18:15:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 438 transitions. [2024-11-22 18:15:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 18:15:15,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:15,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:15:15,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 18:15:15,775 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-22 18:15:15,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:15,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash -168573432, now seen corresponding path program 1 times [2024-11-22 18:15:15,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:15,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092593728] [2024-11-22 18:15:15,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:15:15,777 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-22 18:15:15,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:15,779 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-22 18:15:15,780 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-22 18:15:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:15:15,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:15:15,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:15,985 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:15:15,986 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:15:15,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-22 18:15:16,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:15:16,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-11-22 18:15:16,117 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-22 18:15:16,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:15:16,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:16,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092593728] [2024-11-22 18:15:16,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092593728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:15:16,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:15:16,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:15:16,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480334880] [2024-11-22 18:15:16,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:15:16,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:15:16,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:16,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:15:16,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:15:16,119 INFO L87 Difference]: Start difference. First operand 337 states and 438 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-22 18:15:16,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:15:16,747 INFO L93 Difference]: Finished difference Result 531 states and 694 transitions. [2024-11-22 18:15:16,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:15:16,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-11-22 18:15:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:15:16,750 INFO L225 Difference]: With dead ends: 531 [2024-11-22 18:15:16,750 INFO L226 Difference]: Without dead ends: 531 [2024-11-22 18:15:16,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:15:16,751 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 264 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:15:16,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 799 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:15:16,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-22 18:15:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 336. [2024-11-22 18:15:16,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 328 states have (on average 1.3048780487804879) internal successors, (428), 330 states have internal predecessors, (428), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:15:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 436 transitions. [2024-11-22 18:15:16,780 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 436 transitions. Word has length 15 [2024-11-22 18:15:16,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:15:16,780 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 436 transitions. [2024-11-22 18:15:16,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-22 18:15:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 436 transitions. [2024-11-22 18:15:16,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-22 18:15:16,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:16,787 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] [2024-11-22 18:15:16,795 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-22 18:15:16,987 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-22 18:15:16,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:16,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:16,991 INFO L85 PathProgramCache]: Analyzing trace with hash 223342889, now seen corresponding path program 1 times [2024-11-22 18:15:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:16,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446233518] [2024-11-22 18:15:16,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:15:16,992 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-22 18:15:16,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:17,000 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-22 18:15:17,004 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-22 18:15:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:15:17,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:15:17,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:17,390 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-22 18:15:17,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:15:17,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:17,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446233518] [2024-11-22 18:15:17,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446233518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:15:17,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:15:17,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:15:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578103136] [2024-11-22 18:15:17,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:15:17,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:15:17,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:17,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:15:17,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:15:17,393 INFO L87 Difference]: Start difference. First operand 336 states and 436 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-22 18:15:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:15:17,537 INFO L93 Difference]: Finished difference Result 342 states and 426 transitions. [2024-11-22 18:15:17,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:15:17,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 83 [2024-11-22 18:15:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:15:17,539 INFO L225 Difference]: With dead ends: 342 [2024-11-22 18:15:17,539 INFO L226 Difference]: Without dead ends: 342 [2024-11-22 18:15:17,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-22 18:15:17,542 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 30 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 758 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-22 18:15:17,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 758 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:15:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-22 18:15:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-11-22 18:15:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 334 states have (on average 1.251497005988024) internal successors, (418), 336 states have internal predecessors, (418), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:15:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 426 transitions. [2024-11-22 18:15:17,560 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 426 transitions. Word has length 83 [2024-11-22 18:15:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:15:17,560 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 426 transitions. [2024-11-22 18:15:17,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-22 18:15:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 426 transitions. [2024-11-22 18:15:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-22 18:15:17,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:17,565 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] [2024-11-22 18:15:17,583 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 (5)] Ended with exit code 0 [2024-11-22 18:15:17,765 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-22 18:15:17,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:17,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:17,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1716862051, now seen corresponding path program 1 times [2024-11-22 18:15:17,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:17,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174897696] [2024-11-22 18:15:17,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:15:17,768 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-22 18:15:17,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:17,770 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-22 18:15:17,771 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-22 18:15:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:15:18,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:15:18,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:18,157 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-22 18:15:18,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:15:18,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:18,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174897696] [2024-11-22 18:15:18,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174897696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:15:18,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:15:18,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:15:18,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319769342] [2024-11-22 18:15:18,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:15:18,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:15:18,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:18,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:15:18,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:15:18,160 INFO L87 Difference]: Start difference. First operand 342 states and 426 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-22 18:15:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:15:18,195 INFO L93 Difference]: Finished difference Result 345 states and 430 transitions. [2024-11-22 18:15:18,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:15:18,196 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), 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 83 [2024-11-22 18:15:18,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:15:18,198 INFO L225 Difference]: With dead ends: 345 [2024-11-22 18:15:18,198 INFO L226 Difference]: Without dead ends: 345 [2024-11-22 18:15:18,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 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-22 18:15:18,199 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 821 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.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:15:18,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 821 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:15:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-22 18:15:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2024-11-22 18:15:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 336 states have (on average 1.2529761904761905) internal successors, (421), 339 states have internal predecessors, (421), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:15:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 430 transitions. [2024-11-22 18:15:18,205 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 430 transitions. Word has length 83 [2024-11-22 18:15:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:15:18,206 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 430 transitions. [2024-11-22 18:15:18,206 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), 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-22 18:15:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 430 transitions. [2024-11-22 18:15:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-22 18:15:18,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:18,208 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] [2024-11-22 18:15:18,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 18:15:18,411 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-22 18:15:18,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:18,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash 701158495, now seen corresponding path program 1 times [2024-11-22 18:15:18,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:18,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791522376] [2024-11-22 18:15:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:15:18,413 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-22 18:15:18,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:18,415 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-22 18:15:18,416 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-22 18:15:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:15:18,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:15:18,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:18,790 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-22 18:15:18,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:15:18,894 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-22 18:15:18,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:18,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791522376] [2024-11-22 18:15:18,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791522376] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:15:18,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:15:18,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 18:15:18,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283396103] [2024-11-22 18:15:18,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:15:18,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:15:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:18,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:15:18,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:15:18,897 INFO L87 Difference]: Start difference. First operand 345 states and 430 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-22 18:15:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:15:19,066 INFO L93 Difference]: Finished difference Result 356 states and 446 transitions. [2024-11-22 18:15:19,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:15:19,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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 85 [2024-11-22 18:15:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:15:19,068 INFO L225 Difference]: With dead ends: 356 [2024-11-22 18:15:19,068 INFO L226 Difference]: Without dead ends: 356 [2024-11-22 18:15:19,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 162 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-22 18:15:19,069 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 5 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:15:19,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1364 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:15:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-22 18:15:19,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2024-11-22 18:15:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 344 states have (on average 1.2645348837209303) internal successors, (435), 347 states have internal predecessors, (435), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:15:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 444 transitions. [2024-11-22 18:15:19,075 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 444 transitions. Word has length 85 [2024-11-22 18:15:19,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:15:19,075 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 444 transitions. [2024-11-22 18:15:19,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-22 18:15:19,076 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 444 transitions. [2024-11-22 18:15:19,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 18:15:19,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:19,077 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] [2024-11-22 18:15:19,089 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-22 18:15:19,277 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-22 18:15:19,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:19,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1147835837, now seen corresponding path program 2 times [2024-11-22 18:15:19,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:19,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313405757] [2024-11-22 18:15:19,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:15:19,279 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-22 18:15:19,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:19,280 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-22 18:15:19,282 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-22 18:15:19,543 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 18:15:19,544 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:15:19,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:15:19,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:19,558 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:15:19,559 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:15:19,560 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:15:19,561 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-22 18:15:19,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:15:19,609 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-22 18:15:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-22 18:15:19,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:15:19,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:19,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313405757] [2024-11-22 18:15:19,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313405757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:15:19,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:15:19,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:15:19,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293270763] [2024-11-22 18:15:19,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:15:19,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:15:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:15:19,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:15:19,656 INFO L87 Difference]: Start difference. First operand 354 states and 444 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-22 18:15:20,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:15:20,229 INFO L93 Difference]: Finished difference Result 514 states and 655 transitions. [2024-11-22 18:15:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:15:20,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 89 [2024-11-22 18:15:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:15:20,235 INFO L225 Difference]: With dead ends: 514 [2024-11-22 18:15:20,235 INFO L226 Difference]: Without dead ends: 514 [2024-11-22 18:15:20,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:15:20,236 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 207 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:15:20,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 769 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:15:20,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-22 18:15:20,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 356. [2024-11-22 18:15:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 346 states have (on average 1.2630057803468209) internal successors, (437), 349 states have internal predecessors, (437), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:15:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 446 transitions. [2024-11-22 18:15:20,256 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 446 transitions. Word has length 89 [2024-11-22 18:15:20,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:15:20,257 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 446 transitions. [2024-11-22 18:15:20,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-22 18:15:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 446 transitions. [2024-11-22 18:15:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-22 18:15:20,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:20,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 18:15:20,264 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-22 18:15:20,458 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-22 18:15:20,459 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:20,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:20,461 INFO L85 PathProgramCache]: Analyzing trace with hash -28955861, now seen corresponding path program 1 times [2024-11-22 18:15:20,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:20,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908821543] [2024-11-22 18:15:20,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:15:20,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:15:20,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:20,463 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-22 18:15:20,465 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-22 18:15:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:15:20,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:15:20,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:21,038 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-22 18:15:21,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:15:21,227 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-22 18:15:21,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:21,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908821543] [2024-11-22 18:15:21,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908821543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:15:21,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:15:21,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-22 18:15:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492826664] [2024-11-22 18:15:21,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:15:21,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:15:21,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:21,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:15:21,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:15:21,231 INFO L87 Difference]: Start difference. First operand 356 states and 446 transitions. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 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-22 18:15:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:15:21,736 INFO L93 Difference]: Finished difference Result 371 states and 468 transitions. [2024-11-22 18:15:21,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 18:15:21,737 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 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 125 [2024-11-22 18:15:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:15:21,739 INFO L225 Difference]: With dead ends: 371 [2024-11-22 18:15:21,740 INFO L226 Difference]: Without dead ends: 367 [2024-11-22 18:15:21,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-22 18:15:21,741 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 7 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:15:21,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2453 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:15:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-22 18:15:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2024-11-22 18:15:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 355 states have (on average 1.2647887323943663) internal successors, (449), 358 states have internal predecessors, (449), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:15:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 458 transitions. [2024-11-22 18:15:21,748 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 458 transitions. Word has length 125 [2024-11-22 18:15:21,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:15:21,749 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 458 transitions. [2024-11-22 18:15:21,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 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-22 18:15:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 458 transitions. [2024-11-22 18:15:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 18:15:21,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:21,750 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] [2024-11-22 18:15:21,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-22 18:15:21,953 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-22 18:15:21,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:21,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash 396192818, now seen corresponding path program 2 times [2024-11-22 18:15:21,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:21,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94209211] [2024-11-22 18:15:21,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:15:21,956 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-22 18:15:21,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:21,961 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-22 18:15:21,962 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-22 18:15:22,242 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 18:15:22,243 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:15:22,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:15:22,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-22 18:15:22,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:15:22,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:22,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94209211] [2024-11-22 18:15:22,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94209211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:15:22,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:15:22,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:15:22,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022819739] [2024-11-22 18:15:22,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:15:22,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:15:22,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:22,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:15:22,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:15:22,281 INFO L87 Difference]: Start difference. First operand 365 states and 458 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-22 18:15:22,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:15:22,396 INFO L93 Difference]: Finished difference Result 371 states and 448 transitions. [2024-11-22 18:15:22,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:15:22,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 134 [2024-11-22 18:15:22,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:15:22,398 INFO L225 Difference]: With dead ends: 371 [2024-11-22 18:15:22,398 INFO L226 Difference]: Without dead ends: 371 [2024-11-22 18:15:22,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 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-22 18:15:22,399 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 30 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 725 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-22 18:15:22,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 725 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:15:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-22 18:15:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2024-11-22 18:15:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 361 states have (on average 1.2160664819944598) internal successors, (439), 364 states have internal predecessors, (439), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:15:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 448 transitions. [2024-11-22 18:15:22,408 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 448 transitions. Word has length 134 [2024-11-22 18:15:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:15:22,409 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 448 transitions. [2024-11-22 18:15:22,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-22 18:15:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 448 transitions. [2024-11-22 18:15:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 18:15:22,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:22,410 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] [2024-11-22 18:15:22,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-22 18:15:22,610 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-22 18:15:22,611 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:22,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1746122662, now seen corresponding path program 1 times [2024-11-22 18:15:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:22,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161396031] [2024-11-22 18:15:22,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:15:22,613 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-22 18:15:22,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:22,616 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-22 18:15:22,617 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-22 18:15:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:15:23,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 18:15:23,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:23,370 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-22 18:15:23,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:15:24,086 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-22 18:15:24,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:24,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161396031] [2024-11-22 18:15:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161396031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:15:24,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:15:24,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-22 18:15:24,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77365473] [2024-11-22 18:15:24,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:15:24,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 18:15:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:24,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 18:15:24,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-22 18:15:24,088 INFO L87 Difference]: Start difference. First operand 371 states and 448 transitions. Second operand has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 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-22 18:15:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:15:26,213 INFO L93 Difference]: Finished difference Result 395 states and 488 transitions. [2024-11-22 18:15:26,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-22 18:15:26,214 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 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 134 [2024-11-22 18:15:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:15:26,218 INFO L225 Difference]: With dead ends: 395 [2024-11-22 18:15:26,218 INFO L226 Difference]: Without dead ends: 391 [2024-11-22 18:15:26,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-22 18:15:26,219 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 14 mSDsluCounter, 3662 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3926 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:15:26,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3926 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 18:15:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-22 18:15:26,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2024-11-22 18:15:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 379 states have (on average 1.2216358839050132) internal successors, (463), 382 states have internal predecessors, (463), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:15:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 472 transitions. [2024-11-22 18:15:26,236 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 472 transitions. Word has length 134 [2024-11-22 18:15:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:15:26,236 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 472 transitions. [2024-11-22 18:15:26,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 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-22 18:15:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 472 transitions. [2024-11-22 18:15:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-22 18:15:26,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:26,242 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] [2024-11-22 18:15:26,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-22 18:15:26,443 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-22 18:15:26,443 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:26,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash -320053946, now seen corresponding path program 2 times [2024-11-22 18:15:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017027621] [2024-11-22 18:15:26,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:15:26,445 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-22 18:15:26,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:26,448 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-22 18:15:26,449 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-22 18:15:26,761 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 18:15:26,761 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:15:26,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:15:26,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-22 18:15:26,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:15:26,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:26,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017027621] [2024-11-22 18:15:26,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017027621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:15:26,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:15:26,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:15:26,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893041810] [2024-11-22 18:15:26,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:15:26,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:15:26,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:26,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:15:26,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:15:26,800 INFO L87 Difference]: Start difference. First operand 389 states and 472 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-22 18:15:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:15:26,866 INFO L93 Difference]: Finished difference Result 389 states and 466 transitions. [2024-11-22 18:15:26,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:15:26,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 152 [2024-11-22 18:15:26,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:15:26,868 INFO L225 Difference]: With dead ends: 389 [2024-11-22 18:15:26,868 INFO L226 Difference]: Without dead ends: 389 [2024-11-22 18:15:26,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:15:26,869 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:15:26,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:15:26,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-22 18:15:26,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-11-22 18:15:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 379 states have (on average 1.2058047493403694) internal successors, (457), 382 states have internal predecessors, (457), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:15:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 466 transitions. [2024-11-22 18:15:26,875 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 466 transitions. Word has length 152 [2024-11-22 18:15:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:15:26,875 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 466 transitions. [2024-11-22 18:15:26,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-22 18:15:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 466 transitions. [2024-11-22 18:15:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-22 18:15:26,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:26,876 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] [2024-11-22 18:15:26,881 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-22 18:15:27,077 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-22 18:15:27,078 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:27,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash 701014408, now seen corresponding path program 1 times [2024-11-22 18:15:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909013807] [2024-11-22 18:15:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:15:27,079 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-22 18:15:27,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:27,081 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-22 18:15:27,085 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-22 18:15:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:15:27,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 18:15:27,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:28,301 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-22 18:15:28,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:15:30,184 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-22 18:15:30,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:30,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909013807] [2024-11-22 18:15:30,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909013807] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:15:30,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:15:30,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-22 18:15:30,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832678489] [2024-11-22 18:15:30,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:15:30,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-22 18:15:30,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:30,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-22 18:15:30,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 18:15:30,187 INFO L87 Difference]: Start difference. First operand 389 states and 466 transitions. Second operand has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 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-22 18:15:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:15:38,572 INFO L93 Difference]: Finished difference Result 429 states and 538 transitions. [2024-11-22 18:15:38,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-22 18:15:38,573 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 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 152 [2024-11-22 18:15:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:15:38,574 INFO L225 Difference]: With dead ends: 429 [2024-11-22 18:15:38,574 INFO L226 Difference]: Without dead ends: 425 [2024-11-22 18:15:38,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-22 18:15:38,577 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 26 mSDsluCounter, 6288 mSDsCounter, 0 mSdLazyCounter, 1916 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6552 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:15:38,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6552 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1916 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-22 18:15:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-22 18:15:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 423. [2024-11-22 18:15:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 413 states have (on average 1.2179176755447942) internal successors, (503), 416 states have internal predecessors, (503), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:15:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 512 transitions. [2024-11-22 18:15:38,584 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 512 transitions. Word has length 152 [2024-11-22 18:15:38,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:15:38,584 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 512 transitions. [2024-11-22 18:15:38,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 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-22 18:15:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 512 transitions. [2024-11-22 18:15:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-22 18:15:38,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:38,585 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] [2024-11-22 18:15:38,608 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 (13)] Forceful destruction successful, exit code 0 [2024-11-22 18:15:38,789 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-22 18:15:38,790 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:38,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash -586779288, now seen corresponding path program 2 times [2024-11-22 18:15:38,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:38,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492292788] [2024-11-22 18:15:38,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:15:38,792 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-22 18:15:38,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:38,793 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-22 18:15:38,807 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-22 18:15:40,009 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:15:40,009 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:15:40,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 18:15:40,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:40,667 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-22 18:15:40,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:15:42,595 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-22 18:15:42,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492292788] [2024-11-22 18:15:42,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492292788] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:15:42,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:15:42,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-22 18:15:42,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820071409] [2024-11-22 18:15:42,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:15:42,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-22 18:15:42,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:42,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-22 18:15:42,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-22 18:15:42,598 INFO L87 Difference]: Start difference. First operand 423 states and 512 transitions. Second operand has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 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-22 18:15:49,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:15:49,186 INFO L93 Difference]: Finished difference Result 452 states and 566 transitions. [2024-11-22 18:15:49,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-22 18:15:49,187 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 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 186 [2024-11-22 18:15:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:15:49,191 INFO L225 Difference]: With dead ends: 452 [2024-11-22 18:15:49,191 INFO L226 Difference]: Without dead ends: 452 [2024-11-22 18:15:49,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-22 18:15:49,197 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 26 mSDsluCounter, 6787 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7050 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 18:15:49,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7050 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 18:15:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-22 18:15:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 448. [2024-11-22 18:15:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 438 states have (on average 1.2625570776255708) internal successors, (553), 441 states have internal predecessors, (553), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:15:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 562 transitions. [2024-11-22 18:15:49,207 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 562 transitions. Word has length 186 [2024-11-22 18:15:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:15:49,208 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 562 transitions. [2024-11-22 18:15:49,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 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-22 18:15:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 562 transitions. [2024-11-22 18:15:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-22 18:15:49,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:15:49,213 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] [2024-11-22 18:15:49,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-22 18:15:49,417 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-22 18:15:49,417 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:15:49,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:15:49,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2142800769, now seen corresponding path program 3 times [2024-11-22 18:15:49,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:15:49,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423534966] [2024-11-22 18:15:49,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:15:49,419 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-22 18:15:49,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:15:49,421 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-22 18:15:49,427 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-22 18:15:49,972 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 18:15:49,972 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:15:49,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:15:49,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:15:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4374 trivial. 0 not checked. [2024-11-22 18:15:50,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:15:50,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:15:50,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423534966] [2024-11-22 18:15:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423534966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:15:50,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:15:50,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:15:50,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906011841] [2024-11-22 18:15:50,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:15:50,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:15:50,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:15:50,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:15:50,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:15:50,188 INFO L87 Difference]: Start difference. First operand 448 states and 562 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-22 18:15:54,487 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-22 18:15:58,502 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-22 18:16:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:16:01,314 INFO L93 Difference]: Finished difference Result 539 states and 669 transitions. [2024-11-22 18:16:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:16:01,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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 211 [2024-11-22 18:16:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:16:01,320 INFO L225 Difference]: With dead ends: 539 [2024-11-22 18:16:01,320 INFO L226 Difference]: Without dead ends: 539 [2024-11-22 18:16:01,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 209 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-22 18:16:01,321 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 398 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:16:01,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 491 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2024-11-22 18:16:01,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-22 18:16:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 536. [2024-11-22 18:16:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 526 states have (on average 1.2490494296577948) internal successors, (657), 529 states have internal predecessors, (657), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:16:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 666 transitions. [2024-11-22 18:16:01,331 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 666 transitions. Word has length 211 [2024-11-22 18:16:01,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:16:01,331 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 666 transitions. [2024-11-22 18:16:01,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-22 18:16:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 666 transitions. [2024-11-22 18:16:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-22 18:16:01,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:16:01,333 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] [2024-11-22 18:16:01,347 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-22 18:16:01,533 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-22 18:16:01,534 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:16:01,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:16:01,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1795377227, now seen corresponding path program 1 times [2024-11-22 18:16:01,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:16:01,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456624977] [2024-11-22 18:16:01,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:16:01,536 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-22 18:16:01,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:16:01,539 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-22 18:16:01,542 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-22 18:16:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:16:03,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-22 18:16:03,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:16:05,693 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-22 18:16:05,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:16:13,372 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-22 18:16:13,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:16:13,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456624977] [2024-11-22 18:16:13,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456624977] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:16:13,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:16:13,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-22 18:16:13,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051618993] [2024-11-22 18:16:13,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:16:13,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-22 18:16:13,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:16:13,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-22 18:16:13,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-22 18:16:13,377 INFO L87 Difference]: Start difference. First operand 536 states and 666 transitions. Second operand has 102 states, 102 states have (on average 2.176470588235294) internal successors, (222), 102 states have internal predecessors, (222), 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)