./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.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_SAX_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:22:41,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:22:41,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-22 18:22:41,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:22:41,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:22:41,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:22:41,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:22:41,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:22:41,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:22:41,133 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:22:41,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:22:41,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:22:41,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:22:41,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:22:41,138 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:22:41,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:22:41,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 18:22:41,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:22:41,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:22:41,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:22:41,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:22:41,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 18:22:41,141 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:22:41,141 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:22:41,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:22:41,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 18:22:41,142 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:22:41,142 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:22:41,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:22:41,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:22:41,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 18:22:41,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:22:41,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:22:41,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:22:41,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:22:41,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:22:41,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:22:41,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:22:41,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:22:41,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:22:41,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:22:41,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:22:41,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:22:41,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:22:41,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:22:41,148 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-22 18:22:41,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:22:41,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:22:41,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:22:41,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:22:41,449 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:22:41,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2024-11-22 18:22:42,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:22:43,177 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:22:43,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2024-11-22 18:22:43,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb6e415d/004b68b8dccd4e8fb64d32bb10e523fa/FLAG4e42f18e1 [2024-11-22 18:22:43,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb6e415d/004b68b8dccd4e8fb64d32bb10e523fa [2024-11-22 18:22:43,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:22:43,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:22:43,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:22:43,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:22:43,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:22:43,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:22:43" (1/1) ... [2024-11-22 18:22:43,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7afd7d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:43, skipping insertion in model container [2024-11-22 18:22:43,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:22:43" (1/1) ... [2024-11-22 18:22:43,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:22:43,891 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:22:43,933 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:22:43,940 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:22:43,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:22:43,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:22:43,986 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:22:43,989 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:22:43,991 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:22:44,003 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:22:44,019 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:22:44,020 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:22:44,022 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:22:44,023 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:22:44,026 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:22:44,026 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:22:44,033 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:22:44,036 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:22:44,036 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:22:44,041 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:22:44,043 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:22:44,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:22:44,077 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:22:44,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@11a79bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:44, skipping insertion in model container [2024-11-22 18:22:44,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:22:44,080 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 18:22:44,081 INFO L158 Benchmark]: Toolchain (without parser) took 626.22ms. Allocated memory is still 144.7MB. Free memory was 109.1MB in the beginning and 83.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-22 18:22:44,082 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 144.7MB. Free memory was 114.0MB in the beginning and 113.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:22:44,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.23ms. Allocated memory is still 144.7MB. Free memory was 109.1MB in the beginning and 83.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-22 18:22:44,085 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.21ms. Allocated memory is still 144.7MB. Free memory was 114.0MB in the beginning and 113.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.23ms. Allocated memory is still 144.7MB. Free memory was 109.1MB in the beginning and 83.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_SAX_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:22:46,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:22:46,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-22 18:22:46,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:22:46,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:22:46,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:22:46,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:22:46,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:22:46,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:22:46,181 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:22:46,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:22:46,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:22:46,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:22:46,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:22:46,183 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:22:46,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:22:46,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 18:22:46,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:22:46,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:22:46,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:22:46,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:22:46,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 18:22:46,189 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:22:46,190 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:22:46,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:22:46,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 18:22:46,190 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:22:46,191 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 18:22:46,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:22:46,191 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 18:22:46,192 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:22:46,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:22:46,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 18:22:46,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:22:46,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:22:46,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:22:46,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:22:46,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:22:46,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:22:46,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:22:46,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:22:46,195 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 18:22:46,195 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 18:22:46,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:22:46,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:22:46,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:22:46,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:22:46,196 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-22 18:22:46,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:22:46,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:22:46,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:22:46,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:22:46,549 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:22:46,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2024-11-22 18:22:48,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:22:48,396 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:22:48,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2024-11-22 18:22:48,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f98d2ec70/1c5844bdd1b240b2b9f3ca5cb154e6e6/FLAG1030a0cd9 [2024-11-22 18:22:48,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f98d2ec70/1c5844bdd1b240b2b9f3ca5cb154e6e6 [2024-11-22 18:22:48,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:22:48,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:22:48,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:22:48,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:22:48,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:22:48,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:22:48" (1/1) ... [2024-11-22 18:22:48,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34aaa00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:48, skipping insertion in model container [2024-11-22 18:22:48,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:22:48" (1/1) ... [2024-11-22 18:22:48,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:22:49,186 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:22:49,245 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:22:49,252 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:22:49,255 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:22:49,266 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:22:49,309 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:22:49,315 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:22:49,321 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:22:49,329 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:22:49,341 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:22:49,346 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:22:49,349 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:22:49,351 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:22:49,352 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:22:49,353 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:22:49,360 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:22:49,365 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:22:49,370 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:22:49,370 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:22:49,373 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:22:49,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:22:49,409 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 18:22:49,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:22:49,445 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:22:49,453 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:22:49,455 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:22:49,456 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:22:49,459 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:22:49,485 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:22:49,487 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:22:49,488 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:22:49,491 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:22:49,496 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:22:49,497 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:22:49,498 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:22:49,499 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:22:49,499 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:22:49,500 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:22:49,502 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:22:49,503 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:22:49,504 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:22:49,504 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:22:49,509 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:22:49,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:22:49,519 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:22:49,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:22:49,664 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:22:49,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:49 WrapperNode [2024-11-22 18:22:49,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:22:49,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:22:49,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:22:49,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:22:49,674 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:22:49" (1/1) ... [2024-11-22 18:22:49,714 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:22:49" (1/1) ... [2024-11-22 18:22:49,779 INFO L138 Inliner]: procedures = 179, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1431 [2024-11-22 18:22:49,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:22:49,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:22:49,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:22:49,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:22:49,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:49" (1/1) ... [2024-11-22 18:22:49,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:49" (1/1) ... [2024-11-22 18:22:49,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:49" (1/1) ... [2024-11-22 18:22:49,967 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-22 18:22:49,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:49" (1/1) ... [2024-11-22 18:22:49,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:49" (1/1) ... [2024-11-22 18:22:50,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:49" (1/1) ... [2024-11-22 18:22:50,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:49" (1/1) ... [2024-11-22 18:22:50,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:49" (1/1) ... [2024-11-22 18:22:50,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:49" (1/1) ... [2024-11-22 18:22:50,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:22:50,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:22:50,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:22:50,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:22:50,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:49" (1/1) ... [2024-11-22 18:22:50,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:22:50,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:22:50,092 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:22:50,094 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:22:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 18:22:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 18:22:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 18:22:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 18:22:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-22 18:22:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-22 18:22:50,145 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-22 18:22:50,145 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-22 18:22:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:22:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:22:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:22:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:22:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:22:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:22:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:22:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 18:22:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 18:22:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 18:22:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 18:22:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:22:50,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:22:50,398 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:22:50,401 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:23:04,353 INFO L? ?]: Removed 200 outVars from TransFormulas that were not future-live. [2024-11-22 18:23:04,353 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:23:04,379 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:23:04,380 INFO L316 CfgBuilder]: Removed 77 assume(true) statements. [2024-11-22 18:23:04,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:23:04 BoogieIcfgContainer [2024-11-22 18:23:04,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:23:04,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:23:04,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:23:04,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:23:04,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:22:48" (1/3) ... [2024-11-22 18:23:04,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad6e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:23:04, skipping insertion in model container [2024-11-22 18:23:04,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:22:49" (2/3) ... [2024-11-22 18:23:04,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad6e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:23:04, skipping insertion in model container [2024-11-22 18:23:04,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:23:04" (3/3) ... [2024-11-22 18:23:04,392 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test4-3.i [2024-11-22 18:23:04,410 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:23:04,410 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 18:23:04,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:23:04,480 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;@28154057, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:23:04,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-22 18:23:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 251 states, 241 states have (on average 1.6556016597510372) internal successors, (399), 243 states have internal predecessors, (399), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:23:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 18:23:04,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:23:04,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 18:23:04,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:23:04,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:23:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1419139, now seen corresponding path program 1 times [2024-11-22 18:23:04,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:23:04,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387637593] [2024-11-22 18:23:04,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:23:04,515 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:23:04,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:23:04,519 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:23:04,522 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:23:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:23:04,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 18:23:04,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:23:04,758 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:23:04,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:23:04,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:23:04,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387637593] [2024-11-22 18:23:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387637593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:23:04,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:23:04,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:23:04,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68534558] [2024-11-22 18:23:04,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:23:04,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:23:04,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:23:04,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:23:04,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:23:04,808 INFO L87 Difference]: Start difference. First operand has 251 states, 241 states have (on average 1.6556016597510372) internal successors, (399), 243 states have internal predecessors, (399), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:23:08,917 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:23:12,978 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:23:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:23:14,652 INFO L93 Difference]: Finished difference Result 314 states and 409 transitions. [2024-11-22 18:23:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:23:14,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-22 18:23:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:23:14,671 INFO L225 Difference]: With dead ends: 314 [2024-11-22 18:23:14,671 INFO L226 Difference]: Without dead ends: 310 [2024-11-22 18:23:14,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:23:14,678 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 81 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-11-22 18:23:14,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 659 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2024-11-22 18:23:14,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-22 18:23:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2024-11-22 18:23:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 251 states have (on average 1.298804780876494) internal successors, (326), 252 states have internal predecessors, (326), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:23:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 338 transitions. [2024-11-22 18:23:14,765 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 338 transitions. Word has length 4 [2024-11-22 18:23:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:23:14,766 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 338 transitions. [2024-11-22 18:23:14,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:23:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 338 transitions. [2024-11-22 18:23:14,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 18:23:14,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:23:14,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:23:14,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 18:23:14,968 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:23:14,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:23:14,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:23:14,969 INFO L85 PathProgramCache]: Analyzing trace with hash -227637592, now seen corresponding path program 1 times [2024-11-22 18:23:14,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:23:14,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527492389] [2024-11-22 18:23:14,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:23:14,970 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:23:14,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:23:14,972 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:23:14,974 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:23:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:23:15,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:23:15,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:23:15,195 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:23:15,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:23:15,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:23:15,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527492389] [2024-11-22 18:23:15,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527492389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:23:15,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:23:15,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:23:15,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873822271] [2024-11-22 18:23:15,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:23:15,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:23:15,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:23:15,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:23:15,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:23:15,201 INFO L87 Difference]: Start difference. First operand 260 states and 338 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:23:19,629 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:23:23,779 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:23:28,790 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:23:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:23:29,203 INFO L93 Difference]: Finished difference Result 379 states and 492 transitions. [2024-11-22 18:23:29,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:23:29,206 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-22 18:23:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:23:29,216 INFO L225 Difference]: With dead ends: 379 [2024-11-22 18:23:29,216 INFO L226 Difference]: Without dead ends: 379 [2024-11-22 18:23:29,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:23:29,217 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 156 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:23:29,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 882 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 14.0s Time] [2024-11-22 18:23:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-22 18:23:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-22 18:23:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 367 states have (on average 1.2915531335149864) internal successors, (474), 368 states have internal predecessors, (474), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 18:23:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 492 transitions. [2024-11-22 18:23:29,246 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 492 transitions. Word has length 11 [2024-11-22 18:23:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:23:29,247 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 492 transitions. [2024-11-22 18:23:29,247 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), 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:23:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 492 transitions. [2024-11-22 18:23:29,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:23:29,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:23:29,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:23:29,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-22 18:23:29,450 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:23:29,450 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:23:29,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:23:29,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2107068027, now seen corresponding path program 1 times [2024-11-22 18:23:29,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:23:29,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113385214] [2024-11-22 18:23:29,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:23:29,452 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:23:29,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:23:29,455 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:23:29,456 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:23:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:23:29,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:23:29,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:23:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:23:29,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:23:29,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:23:29,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113385214] [2024-11-22 18:23:29,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113385214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:23:29,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:23:29,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:23:29,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908479968] [2024-11-22 18:23:29,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:23:29,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:23:29,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:23:29,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:23:29,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:23:29,745 INFO L87 Difference]: Start difference. First operand 379 states and 492 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:23:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:23:30,306 INFO L93 Difference]: Finished difference Result 431 states and 559 transitions. [2024-11-22 18:23:30,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:23:30,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 18:23:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:23:30,312 INFO L225 Difference]: With dead ends: 431 [2024-11-22 18:23:30,313 INFO L226 Difference]: Without dead ends: 431 [2024-11-22 18:23:30,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:23:30,314 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 121 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 18:23:30,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 608 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 18:23:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-22 18:23:30,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 377. [2024-11-22 18:23:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 365 states have (on average 1.2876712328767124) internal successors, (470), 366 states have internal predecessors, (470), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 18:23:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 488 transitions. [2024-11-22 18:23:30,331 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 488 transitions. Word has length 27 [2024-11-22 18:23:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:23:30,332 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 488 transitions. [2024-11-22 18:23:30,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:23:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 488 transitions. [2024-11-22 18:23:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:23:30,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:23:30,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:23:30,339 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:23:30,533 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:23:30,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:23:30,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:23:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1289419577, now seen corresponding path program 1 times [2024-11-22 18:23:30,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:23:30,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881213164] [2024-11-22 18:23:30,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:23:30,535 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:23:30,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:23:30,538 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:23:30,540 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:23:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:23:30,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:23:30,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:23:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:23:30,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:23:30,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:23:30,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881213164] [2024-11-22 18:23:30,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881213164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:23:30,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:23:30,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:23:30,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088472870] [2024-11-22 18:23:30,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:23:30,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:23:30,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:23:30,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:23:30,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:23:30,847 INFO L87 Difference]: Start difference. First operand 377 states and 488 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:23:35,142 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:23:39,444 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:23:43,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:23:43,382 INFO L93 Difference]: Finished difference Result 431 states and 558 transitions. [2024-11-22 18:23:43,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:23:43,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 18:23:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:23:43,392 INFO L225 Difference]: With dead ends: 431 [2024-11-22 18:23:43,392 INFO L226 Difference]: Without dead ends: 425 [2024-11-22 18:23:43,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:23:43,393 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 123 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:23:43,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 916 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 2 Unknown, 0 Unchecked, 12.5s Time] [2024-11-22 18:23:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-22 18:23:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 371. [2024-11-22 18:23:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 359 states have (on average 1.2896935933147633) internal successors, (463), 360 states have internal predecessors, (463), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 18:23:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 481 transitions. [2024-11-22 18:23:43,404 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 481 transitions. Word has length 27 [2024-11-22 18:23:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:23:43,404 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 481 transitions. [2024-11-22 18:23:43,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:23:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 481 transitions. [2024-11-22 18:23:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-22 18:23:43,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:23:43,409 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:43,415 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:23:43,610 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:23:43,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:23:43,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:23:43,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1665770981, now seen corresponding path program 1 times [2024-11-22 18:23:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:23:43,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385108864] [2024-11-22 18:23:43,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:23:43,614 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:23:43,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:23:43,617 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:23:43,618 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:23:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:23:44,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:23:44,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:23:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 18:23:44,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:23:44,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:23:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385108864] [2024-11-22 18:23:44,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385108864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:23:44,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:23:44,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:23:44,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462704766] [2024-11-22 18:23:44,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:23:44,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:23:44,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:23:44,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:23:44,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:23:44,393 INFO L87 Difference]: Start difference. First operand 371 states and 481 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:23:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:23:44,478 INFO L93 Difference]: Finished difference Result 377 states and 471 transitions. [2024-11-22 18:23:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:23:44,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 147 [2024-11-22 18:23:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:23:44,480 INFO L225 Difference]: With dead ends: 377 [2024-11-22 18:23:44,480 INFO L226 Difference]: Without dead ends: 377 [2024-11-22 18:23:44,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:23:44,481 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 41 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:23:44,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 850 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:23:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-22 18:23:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-11-22 18:23:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 365 states have (on average 1.2410958904109588) internal successors, (453), 366 states have internal predecessors, (453), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 18:23:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 471 transitions. [2024-11-22 18:23:44,490 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 471 transitions. Word has length 147 [2024-11-22 18:23:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:23:44,491 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 471 transitions. [2024-11-22 18:23:44,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:23:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 471 transitions. [2024-11-22 18:23:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-22 18:23:44,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:23:44,496 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:44,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-22 18:23:44,696 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:23:44,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:23:44,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:23:44,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1359410743, now seen corresponding path program 1 times [2024-11-22 18:23:44,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:23:44,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6238240] [2024-11-22 18:23:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:23:44,699 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:23:44,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:23:44,701 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:23:44,702 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:23:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:23:45,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:23:45,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:23:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 18:23:45,371 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:23:45,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:23:45,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6238240] [2024-11-22 18:23:45,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6238240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:23:45,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:23:45,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:23:45,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187559414] [2024-11-22 18:23:45,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:23:45,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:23:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:23:45,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:23:45,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:23:45,374 INFO L87 Difference]: Start difference. First operand 377 states and 471 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:23:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:23:45,445 INFO L93 Difference]: Finished difference Result 365 states and 451 transitions. [2024-11-22 18:23:45,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:23:45,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 147 [2024-11-22 18:23:45,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:23:45,448 INFO L225 Difference]: With dead ends: 365 [2024-11-22 18:23:45,448 INFO L226 Difference]: Without dead ends: 365 [2024-11-22 18:23:45,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 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:23:45,449 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 9 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:23:45,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 851 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:23:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-22 18:23:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-11-22 18:23:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 353 states have (on average 1.226628895184136) internal successors, (433), 354 states have internal predecessors, (433), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 18:23:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 451 transitions. [2024-11-22 18:23:45,458 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 451 transitions. Word has length 147 [2024-11-22 18:23:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:23:45,458 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 451 transitions. [2024-11-22 18:23:45,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:23:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 451 transitions. [2024-11-22 18:23:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-22 18:23:45,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:23:45,462 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:45,480 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:23:45,662 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:23:45,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:23:45,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:23:45,663 INFO L85 PathProgramCache]: Analyzing trace with hash -336215087, now seen corresponding path program 1 times [2024-11-22 18:23:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:23:45,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936945467] [2024-11-22 18:23:45,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:23:45,664 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:23:45,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:23:45,667 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:23:45,668 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:23:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:23:46,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:23:46,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:23:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 18:23:46,380 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:23:46,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:23:46,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936945467] [2024-11-22 18:23:46,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936945467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:23:46,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:23:46,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:23:46,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725699] [2024-11-22 18:23:46,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:23:46,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:23:46,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:23:46,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:23:46,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:23:46,382 INFO L87 Difference]: Start difference. First operand 365 states and 451 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-22 18:23:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:23:46,463 INFO L93 Difference]: Finished difference Result 368 states and 457 transitions. [2024-11-22 18:23:46,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:23:46,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 147 [2024-11-22 18:23:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:23:46,469 INFO L225 Difference]: With dead ends: 368 [2024-11-22 18:23:46,469 INFO L226 Difference]: Without dead ends: 368 [2024-11-22 18:23:46,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 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:23:46,470 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 0 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:23:46,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 899 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:23:46,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-22 18:23:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-11-22 18:23:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 355 states have (on average 1.228169014084507) internal successors, (436), 357 states have internal predecessors, (436), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-22 18:23:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 457 transitions. [2024-11-22 18:23:46,484 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 457 transitions. Word has length 147 [2024-11-22 18:23:46,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:23:46,486 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 457 transitions. [2024-11-22 18:23:46,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-22 18:23:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 457 transitions. [2024-11-22 18:23:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-22 18:23:46,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:23:46,491 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:46,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 18:23:46,694 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:23:46,695 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:23:46,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:23:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash -21562027, now seen corresponding path program 1 times [2024-11-22 18:23:46,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:23:46,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326901903] [2024-11-22 18:23:46,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:23:46,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:23:46,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:23:46,698 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:23:46,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 18:23:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:23:47,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:23:47,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:23:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 18:23:47,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:23:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-22 18:23:47,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:23:47,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326901903] [2024-11-22 18:23:47,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326901903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:23:47,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:23:47,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 18:23:47,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872248926] [2024-11-22 18:23:47,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:23:47,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:23:47,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:23:47,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:23:47,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:23:47,611 INFO L87 Difference]: Start difference. First operand 368 states and 457 transitions. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 18:23:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:23:47,864 INFO L93 Difference]: Finished difference Result 379 states and 475 transitions. [2024-11-22 18:23:47,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:23:47,865 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 151 [2024-11-22 18:23:47,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:23:47,867 INFO L225 Difference]: With dead ends: 379 [2024-11-22 18:23:47,868 INFO L226 Difference]: Without dead ends: 379 [2024-11-22 18:23:47,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 294 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:23:47,869 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 5 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:23:47,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1195 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:23:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-22 18:23:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2024-11-22 18:23:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 363 states have (on average 1.2396694214876034) internal successors, (450), 365 states have internal predecessors, (450), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-22 18:23:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 471 transitions. [2024-11-22 18:23:47,879 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 471 transitions. Word has length 151 [2024-11-22 18:23:47,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:23:47,879 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 471 transitions. [2024-11-22 18:23:47,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 18:23:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 471 transitions. [2024-11-22 18:23:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-22 18:23:47,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:23:47,881 INFO L215 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:47,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-22 18:23:48,081 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:23:48,082 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:23:48,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:23:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash 427997521, now seen corresponding path program 2 times [2024-11-22 18:23:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:23:48,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026264898] [2024-11-22 18:23:48,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:23:48,084 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:23:48,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:23:48,085 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:23:48,086 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:23:48,842 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:23:48,842 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:23:48,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:23:48,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:23:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 18:23:48,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:23:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-22 18:23:49,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:23:49,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026264898] [2024-11-22 18:23:49,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026264898] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:23:49,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:23:49,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-22 18:23:49,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953565946] [2024-11-22 18:23:49,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:23:49,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:23:49,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:23:49,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:23:49,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:23:49,359 INFO L87 Difference]: Start difference. First operand 377 states and 471 transitions. Second operand has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 14 states have internal predecessors, (149), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 18:23:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:23:50,004 INFO L93 Difference]: Finished difference Result 392 states and 495 transitions. [2024-11-22 18:23:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 18:23:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 14 states have internal predecessors, (149), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 159 [2024-11-22 18:23:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:23:50,008 INFO L225 Difference]: With dead ends: 392 [2024-11-22 18:23:50,008 INFO L226 Difference]: Without dead ends: 388 [2024-11-22 18:23:50,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-22 18:23:50,010 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 8 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:23:50,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1794 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:23:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-22 18:23:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2024-11-22 18:23:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 372 states have (on average 1.2419354838709677) internal successors, (462), 374 states have internal predecessors, (462), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-22 18:23:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 483 transitions. [2024-11-22 18:23:50,021 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 483 transitions. Word has length 159 [2024-11-22 18:23:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:23:50,022 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 483 transitions. [2024-11-22 18:23:50,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 14 states have internal predecessors, (149), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 18:23:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 483 transitions. [2024-11-22 18:23:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-22 18:23:50,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:23:50,024 INFO L215 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:50,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-22 18:23:50,224 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:23:50,225 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:23:50,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:23:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1949202699, now seen corresponding path program 3 times [2024-11-22 18:23:50,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:23:50,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820856853] [2024-11-22 18:23:50,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:23:50,227 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:23:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:23:50,232 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:23:50,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 18:23:51,962 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-22 18:23:51,962 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:23:51,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:23:51,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:23:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 175 proven. 15 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-22 18:23:52,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:23:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 175 proven. 15 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-22 18:23:52,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:23:52,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820856853] [2024-11-22 18:23:52,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820856853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:23:52,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:23:52,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-22 18:23:52,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457533894] [2024-11-22 18:23:52,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:23:52,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 18:23:52,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:23:52,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 18:23:52,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-22 18:23:52,627 INFO L87 Difference]: Start difference. First operand 386 states and 483 transitions. Second operand has 16 states, 16 states have (on average 9.1875) internal successors, (147), 16 states have internal predecessors, (147), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 18:23:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:23:53,663 INFO L93 Difference]: Finished difference Result 397 states and 502 transitions. [2024-11-22 18:23:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 18:23:53,664 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.1875) internal successors, (147), 16 states have internal predecessors, (147), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 177 [2024-11-22 18:23:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:23:53,666 INFO L225 Difference]: With dead ends: 397 [2024-11-22 18:23:53,666 INFO L226 Difference]: Without dead ends: 395 [2024-11-22 18:23:53,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-22 18:23:53,667 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 9 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2968 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:23:53,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2968 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:23:53,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-22 18:23:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2024-11-22 18:23:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 379 states have (on average 1.2532981530343008) internal successors, (475), 381 states have internal predecessors, (475), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-22 18:23:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 496 transitions. [2024-11-22 18:23:53,682 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 496 transitions. Word has length 177 [2024-11-22 18:23:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:23:53,683 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 496 transitions. [2024-11-22 18:23:53,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.1875) internal successors, (147), 16 states have internal predecessors, (147), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 18:23:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 496 transitions. [2024-11-22 18:23:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-22 18:23:53,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:23:53,686 INFO L215 NwaCegarLoop]: trace histogram [44, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:53,704 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:23:53,887 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:23:53,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:23:53,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:23:53,888 INFO L85 PathProgramCache]: Analyzing trace with hash -463141935, now seen corresponding path program 4 times [2024-11-22 18:23:53,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:23:53,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959954524] [2024-11-22 18:23:53,890 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 18:23:53,890 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:23:53,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:23:53,893 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:23:53,894 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:23:54,527 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 18:23:54,528 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:23:54,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:23:54,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:23:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-11-22 18:23:54,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:23:54,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:23:54,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959954524] [2024-11-22 18:23:54,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959954524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:23:54,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:23:54,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:23:54,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061044283] [2024-11-22 18:23:54,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:23:54,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:23:54,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:23:54,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:23:54,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:23:54,601 INFO L87 Difference]: Start difference. First operand 393 states and 496 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-22 18:23:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:23:54,716 INFO L93 Difference]: Finished difference Result 433 states and 536 transitions. [2024-11-22 18:23:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:23:54,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 191 [2024-11-22 18:23:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:23:54,718 INFO L225 Difference]: With dead ends: 433 [2024-11-22 18:23:54,719 INFO L226 Difference]: Without dead ends: 433 [2024-11-22 18:23:54,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 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:23:54,719 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 4 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:23:54,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 557 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:23:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-22 18:23:54,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2024-11-22 18:23:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 419 states have (on average 1.2291169451073987) internal successors, (515), 421 states have internal predecessors, (515), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-22 18:23:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 536 transitions. [2024-11-22 18:23:54,730 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 536 transitions. Word has length 191 [2024-11-22 18:23:54,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:23:54,730 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 536 transitions. [2024-11-22 18:23:54,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-22 18:23:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 536 transitions. [2024-11-22 18:23:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-22 18:23:54,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:23:54,733 INFO L215 NwaCegarLoop]: trace histogram [44, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:54,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-22 18:23:54,933 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:23:54,934 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:23:54,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:23:54,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1302175597, now seen corresponding path program 1 times [2024-11-22 18:23:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:23:54,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513852195] [2024-11-22 18:23:54,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:23:54,935 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:23:54,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:23:54,936 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:23:54,939 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:23:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:23:55,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 18:23:55,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:23:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 417 proven. 55 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2024-11-22 18:23:56,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:23:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 1 proven. 468 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-22 18:23:57,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:23:57,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513852195] [2024-11-22 18:23:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513852195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:23:57,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:23:57,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-22 18:23:57,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870956816] [2024-11-22 18:23:57,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:23:57,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 18:23:57,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:23:57,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 18:23:57,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-22 18:23:57,237 INFO L87 Difference]: Start difference. First operand 433 states and 536 transitions. Second operand has 26 states, 26 states have (on average 6.1923076923076925) internal successors, (161), 26 states have internal predecessors, (161), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 18:23:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:23:59,768 INFO L93 Difference]: Finished difference Result 451 states and 566 transitions. [2024-11-22 18:23:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-22 18:23:59,770 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.1923076923076925) internal successors, (161), 26 states have internal predecessors, (161), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 191 [2024-11-22 18:23:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:23:59,772 INFO L225 Difference]: With dead ends: 451 [2024-11-22 18:23:59,772 INFO L226 Difference]: Without dead ends: 447 [2024-11-22 18:23:59,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-22 18:23:59,774 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 13 mSDsluCounter, 3282 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3583 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:23:59,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3583 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 18:23:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-22 18:23:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2024-11-22 18:23:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 431 states have (on average 1.222737819025522) internal successors, (527), 433 states have internal predecessors, (527), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-22 18:23:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 548 transitions. [2024-11-22 18:23:59,787 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 548 transitions. Word has length 191 [2024-11-22 18:23:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:23:59,787 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 548 transitions. [2024-11-22 18:23:59,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.1923076923076925) internal successors, (161), 26 states have internal predecessors, (161), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 18:23:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 548 transitions. [2024-11-22 18:23:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-22 18:23:59,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:23:59,789 INFO L215 NwaCegarLoop]: trace histogram [68, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:59,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-22 18:23:59,990 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:23:59,990 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:23:59,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:23:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1257011091, now seen corresponding path program 2 times [2024-11-22 18:23:59,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:23:59,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404966982] [2024-11-22 18:23:59,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:23:59,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:23:59,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:23:59,993 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:23:59,995 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:24:00,924 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:24:00,925 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:24:00,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 1525 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 18:24:00,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:24:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2575 backedges. 1137 proven. 253 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2024-11-22 18:24:01,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:24:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2575 backedges. 1 proven. 1386 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2024-11-22 18:24:04,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:24:04,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404966982] [2024-11-22 18:24:04,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404966982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:24:04,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:24:04,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-22 18:24:04,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182571400] [2024-11-22 18:24:04,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:24:04,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-22 18:24:04,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:24:04,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-22 18:24:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 18:24:04,032 INFO L87 Difference]: Start difference. First operand 445 states and 548 transitions. Second operand has 50 states, 50 states have (on average 3.7) internal successors, (185), 50 states have internal predecessors, (185), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 18:24:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:24:10,446 INFO L93 Difference]: Finished difference Result 484 states and 620 transitions. [2024-11-22 18:24:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-22 18:24:10,447 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.7) internal successors, (185), 50 states have internal predecessors, (185), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 215 [2024-11-22 18:24:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:24:10,449 INFO L225 Difference]: With dead ends: 484 [2024-11-22 18:24:10,449 INFO L226 Difference]: Without dead ends: 480 [2024-11-22 18:24:10,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-22 18:24:10,452 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 25 mSDsluCounter, 6857 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7158 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-22 18:24:10,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7158 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1961 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-22 18:24:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-22 18:24:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478. [2024-11-22 18:24:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 464 states have (on average 1.230603448275862) internal successors, (571), 466 states have internal predecessors, (571), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-22 18:24:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 592 transitions. [2024-11-22 18:24:10,463 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 592 transitions. Word has length 215 [2024-11-22 18:24:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:24:10,464 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 592 transitions. [2024-11-22 18:24:10,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.7) internal successors, (185), 50 states have internal predecessors, (185), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 18:24:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 592 transitions. [2024-11-22 18:24:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-22 18:24:10,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:24:10,467 INFO L215 NwaCegarLoop]: trace histogram [134, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:10,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-22 18:24:10,668 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:24:10,668 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:24:10,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:24:10,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1258567283, now seen corresponding path program 3 times [2024-11-22 18:24:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:24:10,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903522948] [2024-11-22 18:24:10,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:24:10,671 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:24:10,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:24:10,674 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:24:10,676 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:24:14,492 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2024-11-22 18:24:14,493 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:24:14,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 18:24:14,534 INFO L278 TraceCheckSpWp]: Computing forward predicates...