./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:24:44,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:24:44,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:24:44,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:24:44,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:24:44,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:24:44,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:24:44,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:24:45,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:24:45,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:24:45,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:24:45,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:24:45,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:24:45,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:24:45,006 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:24:45,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:24:45,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:24:45,007 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:24:45,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:24:45,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:24:45,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:24:45,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:24:45,012 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:24:45,012 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:24:45,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:24:45,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:24:45,013 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:24:45,013 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:24:45,014 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:24:45,014 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:24:45,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:24:45,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:24:45,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:24:45,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:24:45,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:24:45,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:24:45,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:24:45,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:24:45,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:24:45,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:24:45,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:24:45,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:24:45,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:24:45,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:24:45,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:24:45,019 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2024-11-19 06:24:45,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:24:45,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:24:45,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:24:45,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:24:45,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:24:45,321 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_test6-2.i [2024-11-19 06:24:46,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:24:47,139 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:24:47,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-19 06:24:47,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0930a45/4e1096df026c4486a8f3651030079f24/FLAG413e20a2b [2024-11-19 06:24:47,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0930a45/4e1096df026c4486a8f3651030079f24 [2024-11-19 06:24:47,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:24:47,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:24:47,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:24:47,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:24:47,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:24:47,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:24:47" (1/1) ... [2024-11-19 06:24:47,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22384e34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:47, skipping insertion in model container [2024-11-19 06:24:47,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:24:47" (1/1) ... [2024-11-19 06:24:47,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:24:47,810 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-19 06:24:47,848 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-19 06:24:47,853 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-19 06:24:47,858 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-19 06:24:47,867 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-19 06:24:47,913 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-19 06:24:47,917 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:24:47,919 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-19 06:24:47,920 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-19 06:24:47,922 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-19 06:24:47,923 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:24:47,927 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-19 06:24:47,928 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:24:47,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-19 06:24:47,937 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:24:47,939 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:24:47,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-19 06:24:47,944 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:24:47,944 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:24:47,947 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-19 06:24:47,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:24:47,984 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-19 06:24:47,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@ed727a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:47, skipping insertion in model container [2024-11-19 06:24:47,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:24:47,986 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:24:47,988 INFO L158 Benchmark]: Toolchain (without parser) took 799.49ms. Allocated memory is still 169.9MB. Free memory was 96.9MB in the beginning and 123.5MB in the end (delta: -26.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 06:24:47,988 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 169.9MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:24:47,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 795.66ms. Allocated memory is still 169.9MB. Free memory was 96.6MB in the beginning and 123.5MB in the end (delta: -26.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 06:24:47,990 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.13ms. Allocated memory is still 169.9MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 795.66ms. Allocated memory is still 169.9MB. Free memory was 96.6MB in the beginning and 123.5MB in the end (delta: -26.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:24:50,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:24:50,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-19 06:24:50,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:24:50,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:24:50,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:24:50,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:24:50,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:24:50,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:24:50,146 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:24:50,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:24:50,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:24:50,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:24:50,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:24:50,148 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:24:50,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:24:50,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:24:50,149 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:24:50,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:24:50,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:24:50,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:24:50,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:24:50,154 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:24:50,154 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:24:50,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:24:50,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:24:50,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:24:50,155 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:24:50,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:24:50,155 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:24:50,157 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:24:50,157 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:24:50,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:24:50,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:24:50,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:24:50,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:24:50,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:24:50,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:24:50,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:24:50,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:24:50,159 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:24:50,160 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:24:50,160 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:24:50,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:24:50,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:24:50,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:24:50,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:24:50,161 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2024-11-19 06:24:50,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:24:50,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:24:50,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:24:50,523 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:24:50,524 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:24:50,525 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_test6-2.i [2024-11-19 06:24:52,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:24:52,426 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:24:52,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-19 06:24:52,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/835d1c864/1f2dfe273a044297a7cdc48eaa37d6c7/FLAG3b227882c [2024-11-19 06:24:52,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/835d1c864/1f2dfe273a044297a7cdc48eaa37d6c7 [2024-11-19 06:24:52,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:24:52,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:24:52,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:24:52,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:24:52,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:24:52,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:24:52" (1/1) ... [2024-11-19 06:24:52,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1b3d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:52, skipping insertion in model container [2024-11-19 06:24:52,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:24:52" (1/1) ... [2024-11-19 06:24:52,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:24:53,300 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-19 06:24:53,336 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-19 06:24:53,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-19 06:24:53,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-19 06:24:53,358 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-19 06:24:53,398 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-19 06:24:53,399 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-19 06:24:53,401 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-19 06:24:53,404 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-19 06:24:53,407 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-19 06:24:53,413 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-19 06:24:53,414 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-19 06:24:53,417 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-19 06:24:53,420 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-19 06:24:53,424 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-19 06:24:53,426 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-19 06:24:53,431 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-19 06:24:53,432 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-19 06:24:53,432 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-19 06:24:53,435 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-19 06:24:53,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:24:53,468 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:24:53,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:24:53,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-19 06:24:53,535 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-19 06:24:53,539 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-19 06:24:53,541 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-19 06:24:53,546 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-19 06:24:53,569 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-19 06:24:53,570 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-19 06:24:53,571 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-19 06:24:53,574 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-19 06:24:53,576 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-19 06:24:53,577 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-19 06:24:53,580 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-19 06:24:53,581 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-19 06:24:53,583 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-19 06:24:53,584 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-19 06:24:53,588 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-19 06:24:53,589 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-19 06:24:53,590 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-19 06:24:53,591 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:24:53,597 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:24:53,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:24:53,604 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:24:53,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:24:53,764 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:24:53,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53 WrapperNode [2024-11-19 06:24:53,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:24:53,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:24:53,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:24:53,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:24:53,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53" (1/1) ... [2024-11-19 06:24:53,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53" (1/1) ... [2024-11-19 06:24:53,903 INFO L138 Inliner]: procedures = 286, calls = 353, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1233 [2024-11-19 06:24:53,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:24:53,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:24:53,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:24:53,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:24:53,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53" (1/1) ... [2024-11-19 06:24:53,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53" (1/1) ... [2024-11-19 06:24:53,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53" (1/1) ... [2024-11-19 06:24:54,025 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 270, 34]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 57, 4]. [2024-11-19 06:24:54,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53" (1/1) ... [2024-11-19 06:24:54,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53" (1/1) ... [2024-11-19 06:24:54,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53" (1/1) ... [2024-11-19 06:24:54,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53" (1/1) ... [2024-11-19 06:24:54,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53" (1/1) ... [2024-11-19 06:24:54,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53" (1/1) ... [2024-11-19 06:24:54,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:24:54,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:24:54,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:24:54,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:24:54,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53" (1/1) ... [2024-11-19 06:24:54,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:24:54,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:24:54,145 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-19 06:24:54,184 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-19 06:24:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:24:54,227 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:24:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:24:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:24:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 06:24:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 06:24:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:24:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:24:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 06:24:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 06:24:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:24:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:24:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:24:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:24:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 06:24:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:24:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:24:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:24:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 06:24:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 06:24:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:24:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:24:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 06:24:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 06:24:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 06:24:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 06:24:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 06:24:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 06:24:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-19 06:24:54,232 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-19 06:24:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 06:24:54,233 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 06:24:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:24:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:24:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-19 06:24:54,233 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-19 06:24:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:24:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:24:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:24:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 06:24:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-19 06:24:54,234 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-19 06:24:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:24:54,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:24:54,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:24:54,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:25:01,008 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2024-11-19 06:25:01,008 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:25:01,025 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:25:01,025 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-19 06:25:01,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:25:01 BoogieIcfgContainer [2024-11-19 06:25:01,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:25:01,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:25:01,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:25:01,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:25:01,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:24:52" (1/3) ... [2024-11-19 06:25:01,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371c477b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:25:01, skipping insertion in model container [2024-11-19 06:25:01,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:24:53" (2/3) ... [2024-11-19 06:25:01,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371c477b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:25:01, skipping insertion in model container [2024-11-19 06:25:01,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:25:01" (3/3) ... [2024-11-19 06:25:01,037 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-2.i [2024-11-19 06:25:01,049 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:25:01,049 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:25:01,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:25:01,117 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;@75486562, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:25:01,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:25:01,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 269 states, 242 states have (on average 1.6074380165289257) internal successors, (389), 247 states have internal predecessors, (389), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 06:25:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:25:01,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:01,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:01,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:01,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1647492033, now seen corresponding path program 1 times [2024-11-19 06:25:01,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:01,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537519402] [2024-11-19 06:25:01,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:25:01,148 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-19 06:25:01,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:01,152 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-19 06:25:01,153 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-19 06:25:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:25:01,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:25:01,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:01,398 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-19 06:25:01,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:25:01,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:01,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537519402] [2024-11-19 06:25:01,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537519402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:25:01,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:25:01,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:25:01,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900600997] [2024-11-19 06:25:01,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:25:01,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:25:01,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:01,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:25:01,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:25:01,438 INFO L87 Difference]: Start difference. First operand has 269 states, 242 states have (on average 1.6074380165289257) internal successors, (389), 247 states have internal predecessors, (389), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:25:01,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:25:01,483 INFO L93 Difference]: Finished difference Result 264 states and 342 transitions. [2024-11-19 06:25:01,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:25:01,486 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-19 06:25:01,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:25:01,500 INFO L225 Difference]: With dead ends: 264 [2024-11-19 06:25:01,500 INFO L226 Difference]: Without dead ends: 262 [2024-11-19 06:25:01,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:25:01,507 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:25:01,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:25:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-19 06:25:01,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-11-19 06:25:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.2911392405063291) internal successors, (306), 242 states have internal predecessors, (306), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 06:25:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 340 transitions. [2024-11-19 06:25:01,569 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 340 transitions. Word has length 10 [2024-11-19 06:25:01,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:25:01,570 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 340 transitions. [2024-11-19 06:25:01,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:25:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 340 transitions. [2024-11-19 06:25:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:25:01,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:01,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:01,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:25:01,775 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-19 06:25:01,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:01,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash -617339998, now seen corresponding path program 1 times [2024-11-19 06:25:01,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:01,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740200321] [2024-11-19 06:25:01,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:25:01,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:25:01,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:01,779 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-19 06:25:01,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 06:25:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:25:02,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:25:02,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:02,125 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-19 06:25:02,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:25:02,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:02,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740200321] [2024-11-19 06:25:02,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740200321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:25:02,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:25:02,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:25:02,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935449876] [2024-11-19 06:25:02,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:25:02,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:25:02,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:02,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:25:02,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:25:02,131 INFO L87 Difference]: Start difference. First operand 262 states and 340 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:25:04,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:25:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:25:07,204 INFO L93 Difference]: Finished difference Result 418 states and 545 transitions. [2024-11-19 06:25:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:25:07,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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-19 06:25:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:25:07,208 INFO L225 Difference]: With dead ends: 418 [2024-11-19 06:25:07,208 INFO L226 Difference]: Without dead ends: 418 [2024-11-19 06:25:07,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:25:07,210 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 186 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:25:07,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 971 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-19 06:25:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-19 06:25:07,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 381. [2024-11-19 06:25:07,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 353 states have (on average 1.2946175637393769) internal successors, (457), 358 states have internal predecessors, (457), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 06:25:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 497 transitions. [2024-11-19 06:25:07,237 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 497 transitions. Word has length 12 [2024-11-19 06:25:07,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:25:07,241 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 497 transitions. [2024-11-19 06:25:07,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:25:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 497 transitions. [2024-11-19 06:25:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:25:07,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:07,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:07,247 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-19 06:25:07,443 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-19 06:25:07,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:07,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash -919823020, now seen corresponding path program 1 times [2024-11-19 06:25:07,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:07,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515284144] [2024-11-19 06:25:07,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:25:07,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:25:07,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:07,446 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-19 06:25:07,447 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-19 06:25:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:25:07,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:25:07,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:07,742 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:25:07,743 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:25:07,744 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:25:07,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-19 06:25:07,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:25:07,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-19 06:25:07,841 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-19 06:25:07,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:25:07,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:07,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515284144] [2024-11-19 06:25:07,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515284144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:25:07,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:25:07,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:25:07,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427299919] [2024-11-19 06:25:07,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:25:07,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:25:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:25:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:25:07,847 INFO L87 Difference]: Start difference. First operand 381 states and 497 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:25:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:25:08,355 INFO L93 Difference]: Finished difference Result 596 states and 785 transitions. [2024-11-19 06:25:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:25:08,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 06:25:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:25:08,359 INFO L225 Difference]: With dead ends: 596 [2024-11-19 06:25:08,359 INFO L226 Difference]: Without dead ends: 596 [2024-11-19 06:25:08,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:25:08,361 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 274 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:25:08,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1050 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:25:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-19 06:25:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 380. [2024-11-19 06:25:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 352 states have (on average 1.2926136363636365) internal successors, (455), 357 states have internal predecessors, (455), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 06:25:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 495 transitions. [2024-11-19 06:25:08,405 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 495 transitions. Word has length 15 [2024-11-19 06:25:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:25:08,405 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 495 transitions. [2024-11-19 06:25:08,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:25:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 495 transitions. [2024-11-19 06:25:08,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 06:25:08,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:08,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:08,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:25:08,612 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-19 06:25:08,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:08,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2120572721, now seen corresponding path program 1 times [2024-11-19 06:25:08,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:08,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448153804] [2024-11-19 06:25:08,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:25:08,615 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-19 06:25:08,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:08,618 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-19 06:25:08,621 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-19 06:25:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:25:08,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:25:08,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:08,955 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-19 06:25:08,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:25:08,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:08,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448153804] [2024-11-19 06:25:08,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448153804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:25:08,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:25:08,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:25:08,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985134613] [2024-11-19 06:25:08,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:25:08,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:25:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:25:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:25:08,958 INFO L87 Difference]: Start difference. First operand 380 states and 495 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:25:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:25:09,053 INFO L93 Difference]: Finished difference Result 386 states and 485 transitions. [2024-11-19 06:25:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:25:09,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-19 06:25:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:25:09,056 INFO L225 Difference]: With dead ends: 386 [2024-11-19 06:25:09,056 INFO L226 Difference]: Without dead ends: 386 [2024-11-19 06:25:09,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-19 06:25:09,057 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 30 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:25:09,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 911 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:25:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-19 06:25:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-11-19 06:25:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 358 states have (on average 1.2430167597765363) internal successors, (445), 363 states have internal predecessors, (445), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 06:25:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 485 transitions. [2024-11-19 06:25:09,069 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 485 transitions. Word has length 50 [2024-11-19 06:25:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:25:09,069 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 485 transitions. [2024-11-19 06:25:09,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:25:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 485 transitions. [2024-11-19 06:25:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 06:25:09,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:09,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:09,079 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-19 06:25:09,271 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-19 06:25:09,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:09,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1719810523, now seen corresponding path program 1 times [2024-11-19 06:25:09,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:09,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617309272] [2024-11-19 06:25:09,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:25:09,273 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-19 06:25:09,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:09,275 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-19 06:25:09,276 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-19 06:25:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:25:09,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:25:09,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:09,627 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-19 06:25:09,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:25:09,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:09,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617309272] [2024-11-19 06:25:09,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617309272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:25:09,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:25:09,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:25:09,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251788129] [2024-11-19 06:25:09,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:25:09,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:25:09,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:09,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:25:09,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:25:09,630 INFO L87 Difference]: Start difference. First operand 386 states and 485 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:25:09,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:25:09,740 INFO L93 Difference]: Finished difference Result 396 states and 495 transitions. [2024-11-19 06:25:09,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:25:09,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-19 06:25:09,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:25:09,745 INFO L225 Difference]: With dead ends: 396 [2024-11-19 06:25:09,745 INFO L226 Difference]: Without dead ends: 396 [2024-11-19 06:25:09,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:25:09,746 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 9 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:25:09,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1611 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:25:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-19 06:25:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-19 06:25:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 365 states have (on average 1.2410958904109588) internal successors, (453), 371 states have internal predecessors, (453), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 06:25:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 495 transitions. [2024-11-19 06:25:09,760 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 495 transitions. Word has length 50 [2024-11-19 06:25:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:25:09,761 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 495 transitions. [2024-11-19 06:25:09,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:25:09,761 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 495 transitions. [2024-11-19 06:25:09,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 06:25:09,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:09,763 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:09,772 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-19 06:25:09,963 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-19 06:25:09,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:09,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2051735363, now seen corresponding path program 1 times [2024-11-19 06:25:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:09,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245413062] [2024-11-19 06:25:09,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:25:09,965 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-19 06:25:09,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:09,969 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-19 06:25:09,970 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-19 06:25:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:25:10,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:25:10,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:25:10,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:25:10,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:10,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245413062] [2024-11-19 06:25:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245413062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:25:10,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:25:10,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:25:10,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522386545] [2024-11-19 06:25:10,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:25:10,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:25:10,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:10,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:25:10,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:25:10,570 INFO L87 Difference]: Start difference. First operand 396 states and 495 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:25:10,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:25:10,773 INFO L93 Difference]: Finished difference Result 404 states and 505 transitions. [2024-11-19 06:25:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:25:10,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2024-11-19 06:25:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:25:10,779 INFO L225 Difference]: With dead ends: 404 [2024-11-19 06:25:10,779 INFO L226 Difference]: Without dead ends: 404 [2024-11-19 06:25:10,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:25:10,782 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 20 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:25:10,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1178 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:25:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-19 06:25:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 400. [2024-11-19 06:25:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 367 states have (on average 1.2397820163487738) internal successors, (455), 374 states have internal predecessors, (455), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-19 06:25:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 500 transitions. [2024-11-19 06:25:10,798 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 500 transitions. Word has length 65 [2024-11-19 06:25:10,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:25:10,799 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 500 transitions. [2024-11-19 06:25:10,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:25:10,801 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 500 transitions. [2024-11-19 06:25:10,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-19 06:25:10,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:10,802 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:10,815 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-19 06:25:11,003 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-19 06:25:11,003 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:11,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2090919877, now seen corresponding path program 1 times [2024-11-19 06:25:11,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:11,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535871001] [2024-11-19 06:25:11,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:25:11,005 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-19 06:25:11,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:11,006 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-19 06:25:11,007 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-19 06:25:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:25:11,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:25:11,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:25:11,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:25:11,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:11,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535871001] [2024-11-19 06:25:11,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535871001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:25:11,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:25:11,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:25:11,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012456753] [2024-11-19 06:25:11,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:25:11,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:25:11,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:11,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:25:11,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:25:11,482 INFO L87 Difference]: Start difference. First operand 400 states and 500 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:25:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:25:11,532 INFO L93 Difference]: Finished difference Result 404 states and 505 transitions. [2024-11-19 06:25:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:25:11,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2024-11-19 06:25:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:25:11,535 INFO L225 Difference]: With dead ends: 404 [2024-11-19 06:25:11,535 INFO L226 Difference]: Without dead ends: 404 [2024-11-19 06:25:11,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 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-19 06:25:11,536 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 0 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:25:11,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 970 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:25:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-19 06:25:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-19 06:25:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 370 states have (on average 1.2405405405405405) internal successors, (459), 378 states have internal predecessors, (459), 24 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-11-19 06:25:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 505 transitions. [2024-11-19 06:25:11,548 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 505 transitions. Word has length 70 [2024-11-19 06:25:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:25:11,548 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 505 transitions. [2024-11-19 06:25:11,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:25:11,549 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 505 transitions. [2024-11-19 06:25:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 06:25:11,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:11,550 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:11,562 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-19 06:25:11,751 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-19 06:25:11,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:11,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash -731053154, now seen corresponding path program 1 times [2024-11-19 06:25:11,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:11,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636790686] [2024-11-19 06:25:11,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:25:11,753 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-19 06:25:11,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:11,756 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-19 06:25:11,757 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-19 06:25:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:25:12,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:25:12,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:25:12,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:25:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:25:12,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:12,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636790686] [2024-11-19 06:25:12,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636790686] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:25:12,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:25:12,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:25:12,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292332526] [2024-11-19 06:25:12,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:25:12,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:25:12,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:12,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:25:12,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:25:12,305 INFO L87 Difference]: Start difference. First operand 404 states and 505 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:25:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:25:12,448 INFO L93 Difference]: Finished difference Result 417 states and 523 transitions. [2024-11-19 06:25:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:25:12,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 71 [2024-11-19 06:25:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:25:12,452 INFO L225 Difference]: With dead ends: 417 [2024-11-19 06:25:12,452 INFO L226 Difference]: Without dead ends: 417 [2024-11-19 06:25:12,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 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-19 06:25:12,454 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 5 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:25:12,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1289 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:25:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-19 06:25:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2024-11-19 06:25:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 379 states have (on average 1.2506596306068603) internal successors, (474), 387 states have internal predecessors, (474), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-11-19 06:25:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 520 transitions. [2024-11-19 06:25:12,467 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 520 transitions. Word has length 71 [2024-11-19 06:25:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:25:12,467 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 520 transitions. [2024-11-19 06:25:12,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:25:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 520 transitions. [2024-11-19 06:25:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 06:25:12,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:12,469 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:12,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 (9)] Ended with exit code 0 [2024-11-19 06:25:12,669 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-19 06:25:12,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:12,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:12,670 INFO L85 PathProgramCache]: Analyzing trace with hash 481662469, now seen corresponding path program 2 times [2024-11-19 06:25:12,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:12,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839998763] [2024-11-19 06:25:12,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:25:12,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-19 06:25:12,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:12,674 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-19 06:25:12,675 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-19 06:25:13,284 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:25:13,284 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:25:13,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:25:13,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:25:13,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:25:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:25:13,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:13,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839998763] [2024-11-19 06:25:13,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839998763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:25:13,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:25:13,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 06:25:13,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599148912] [2024-11-19 06:25:13,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:25:13,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:25:13,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:13,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:25:13,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:25:13,765 INFO L87 Difference]: Start difference. First operand 414 states and 520 transitions. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:25:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:25:15,361 INFO L93 Difference]: Finished difference Result 3135 states and 4016 transitions. [2024-11-19 06:25:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 06:25:15,362 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2024-11-19 06:25:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:25:15,380 INFO L225 Difference]: With dead ends: 3135 [2024-11-19 06:25:15,380 INFO L226 Difference]: Without dead ends: 3135 [2024-11-19 06:25:15,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2024-11-19 06:25:15,381 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 3339 mSDsluCounter, 5321 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3365 SdHoareTripleChecker+Valid, 6223 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:25:15,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3365 Valid, 6223 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 06:25:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2024-11-19 06:25:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2156. [2024-11-19 06:25:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2018 states have (on average 1.265609514370664) internal successors, (2554), 2039 states have internal predecessors, (2554), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-19 06:25:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2754 transitions. [2024-11-19 06:25:15,449 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2754 transitions. Word has length 74 [2024-11-19 06:25:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:25:15,451 INFO L471 AbstractCegarLoop]: Abstraction has 2156 states and 2754 transitions. [2024-11-19 06:25:15,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:25:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2754 transitions. [2024-11-19 06:25:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 06:25:15,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:15,453 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:15,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 06:25:15,653 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-19 06:25:15,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:15,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:15,654 INFO L85 PathProgramCache]: Analyzing trace with hash 91174169, now seen corresponding path program 1 times [2024-11-19 06:25:15,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:15,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546186878] [2024-11-19 06:25:15,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:25:15,655 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-19 06:25:15,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:15,656 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-19 06:25:15,657 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-19 06:25:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:25:16,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:25:16,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:25:16,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:25:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 06:25:16,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:16,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546186878] [2024-11-19 06:25:16,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546186878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:25:16,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:25:16,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 06:25:16,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935596382] [2024-11-19 06:25:16,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:25:16,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:25:16,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:16,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:25:16,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:25:16,523 INFO L87 Difference]: Start difference. First operand 2156 states and 2754 transitions. Second operand has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:25:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:25:17,126 INFO L93 Difference]: Finished difference Result 2246 states and 2879 transitions. [2024-11-19 06:25:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:25:17,128 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2024-11-19 06:25:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:25:17,136 INFO L225 Difference]: With dead ends: 2246 [2024-11-19 06:25:17,136 INFO L226 Difference]: Without dead ends: 2216 [2024-11-19 06:25:17,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 206 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-19 06:25:17,137 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 8 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:25:17,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1933 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:25:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2024-11-19 06:25:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2201. [2024-11-19 06:25:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2201 states, 2063 states have (on average 1.2670867668444012) internal successors, (2614), 2084 states have internal predecessors, (2614), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-19 06:25:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 2201 states and 2814 transitions. [2024-11-19 06:25:17,194 INFO L78 Accepts]: Start accepts. Automaton has 2201 states and 2814 transitions. Word has length 110 [2024-11-19 06:25:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:25:17,195 INFO L471 AbstractCegarLoop]: Abstraction has 2201 states and 2814 transitions. [2024-11-19 06:25:17,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:25:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 2814 transitions. [2024-11-19 06:25:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 06:25:17,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:17,197 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:17,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 06:25:17,398 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-19 06:25:17,398 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:17,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1756987024, now seen corresponding path program 2 times [2024-11-19 06:25:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:17,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216031639] [2024-11-19 06:25:17,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:25:17,400 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-19 06:25:17,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:17,401 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-19 06:25:17,402 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-19 06:25:17,769 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:25:17,769 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:25:17,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:25:17,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:17,790 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:25:17,790 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:25:17,791 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:25:17,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-19 06:25:17,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:25:17,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-19 06:25:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-19 06:25:17,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:25:17,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:17,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216031639] [2024-11-19 06:25:17,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216031639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:25:17,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:25:17,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:25:17,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282848240] [2024-11-19 06:25:17,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:25:17,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:25:17,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:17,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:25:17,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:25:17,859 INFO L87 Difference]: Start difference. First operand 2201 states and 2814 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 06:25:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:25:18,219 INFO L93 Difference]: Finished difference Result 2971 states and 3834 transitions. [2024-11-19 06:25:18,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:25:18,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 119 [2024-11-19 06:25:18,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:25:18,231 INFO L225 Difference]: With dead ends: 2971 [2024-11-19 06:25:18,231 INFO L226 Difference]: Without dead ends: 2971 [2024-11-19 06:25:18,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 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-19 06:25:18,232 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 215 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:25:18,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 913 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:25:18,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2024-11-19 06:25:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2213. [2024-11-19 06:25:18,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2075 states have (on average 1.2655421686746988) internal successors, (2626), 2096 states have internal predecessors, (2626), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-19 06:25:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2826 transitions. [2024-11-19 06:25:18,291 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2826 transitions. Word has length 119 [2024-11-19 06:25:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:25:18,292 INFO L471 AbstractCegarLoop]: Abstraction has 2213 states and 2826 transitions. [2024-11-19 06:25:18,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 06:25:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2826 transitions. [2024-11-19 06:25:18,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 06:25:18,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:18,294 INFO L215 NwaCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:18,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 06:25:18,495 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-19 06:25:18,495 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:18,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:18,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1356606875, now seen corresponding path program 1 times [2024-11-19 06:25:18,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:18,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489902056] [2024-11-19 06:25:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:25:18,497 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-19 06:25:18,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:18,498 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-19 06:25:18,499 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-19 06:25:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:25:19,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 06:25:19,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 95 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 06:25:19,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:25:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-19 06:25:20,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:20,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489902056] [2024-11-19 06:25:20,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489902056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:25:20,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:25:20,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 06:25:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831713763] [2024-11-19 06:25:20,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:25:20,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:25:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:20,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:25:20,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:25:20,044 INFO L87 Difference]: Start difference. First operand 2213 states and 2826 transitions. Second operand has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 06:25:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:25:22,561 INFO L93 Difference]: Finished difference Result 2348 states and 3041 transitions. [2024-11-19 06:25:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:25:22,563 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2024-11-19 06:25:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:25:22,570 INFO L225 Difference]: With dead ends: 2348 [2024-11-19 06:25:22,571 INFO L226 Difference]: Without dead ends: 2318 [2024-11-19 06:25:22,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 06:25:22,573 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 14 mSDsluCounter, 4172 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4497 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:25:22,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4497 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:25:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2024-11-19 06:25:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2303. [2024-11-19 06:25:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 2165 states have (on average 1.2683602771362588) internal successors, (2746), 2186 states have internal predecessors, (2746), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-19 06:25:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 2946 transitions. [2024-11-19 06:25:22,636 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 2946 transitions. Word has length 126 [2024-11-19 06:25:22,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:25:22,637 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 2946 transitions. [2024-11-19 06:25:22,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 06:25:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2946 transitions. [2024-11-19 06:25:22,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-19 06:25:22,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:22,639 INFO L215 NwaCegarLoop]: trace histogram [33, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:22,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-19 06:25:22,839 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-19 06:25:22,840 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:22,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:22,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1020044859, now seen corresponding path program 2 times [2024-11-19 06:25:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:22,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589787786] [2024-11-19 06:25:22,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:25:22,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:25:22,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:22,847 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-19 06:25:22,848 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-19 06:25:24,003 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:25:24,003 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:25:24,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 06:25:24,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 317 proven. 253 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-19 06:25:24,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:25:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-19 06:25:26,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:26,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589787786] [2024-11-19 06:25:26,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589787786] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:25:26,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:25:26,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 06:25:26,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32645097] [2024-11-19 06:25:26,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:25:26,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 06:25:26,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:26,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 06:25:26,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:25:26,579 INFO L87 Difference]: Start difference. First operand 2303 states and 2946 transitions. Second operand has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 06:25:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:25:37,714 INFO L93 Difference]: Finished difference Result 2518 states and 3321 transitions. [2024-11-19 06:25:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 06:25:37,716 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 144 [2024-11-19 06:25:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:25:37,724 INFO L225 Difference]: With dead ends: 2518 [2024-11-19 06:25:37,725 INFO L226 Difference]: Without dead ends: 2488 [2024-11-19 06:25:37,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 06:25:37,728 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 25 mSDsluCounter, 7705 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8030 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:25:37,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8030 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 06:25:37,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2024-11-19 06:25:37,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2473. [2024-11-19 06:25:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2335 states have (on average 1.2745182012847966) internal successors, (2976), 2356 states have internal predecessors, (2976), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-19 06:25:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3176 transitions. [2024-11-19 06:25:37,794 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3176 transitions. Word has length 144 [2024-11-19 06:25:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:25:37,794 INFO L471 AbstractCegarLoop]: Abstraction has 2473 states and 3176 transitions. [2024-11-19 06:25:37,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 06:25:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3176 transitions. [2024-11-19 06:25:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-19 06:25:37,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:25:37,797 INFO L215 NwaCegarLoop]: trace histogram [67, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:25:37,829 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-19 06:25:37,998 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-19 06:25:37,998 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:25:37,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:25:38,000 INFO L85 PathProgramCache]: Analyzing trace with hash 873821541, now seen corresponding path program 3 times [2024-11-19 06:25:38,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:25:38,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507055245] [2024-11-19 06:25:38,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:25:38,001 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-19 06:25:38,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:25:38,004 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-19 06:25:38,006 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-19 06:25:39,126 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:25:39,126 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:25:39,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 06:25:39,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:25:39,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2024-11-19 06:25:39,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 334 [2024-11-19 06:25:39,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 214 [2024-11-19 06:25:39,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:25:39,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 94 [2024-11-19 06:25:40,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 116 [2024-11-19 06:25:40,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 68 [2024-11-19 06:25:40,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:25:40,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 20 [2024-11-19 06:25:41,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:25:41,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 106 [2024-11-19 06:25:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2024-11-19 06:25:41,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:25:41,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:25:41,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507055245] [2024-11-19 06:25:41,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507055245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:25:41,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:25:41,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 06:25:41,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065937536] [2024-11-19 06:25:41,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:25:41,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:25:41,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:25:41,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:25:41,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:25:41,524 INFO L87 Difference]: Start difference. First operand 2473 states and 3176 transitions. Second operand has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 06:25:43,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:25:46,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:25:47,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:25:58,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:26:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:26:00,449 INFO L93 Difference]: Finished difference Result 3131 states and 4032 transitions. [2024-11-19 06:26:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 06:26:00,450 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 178 [2024-11-19 06:26:00,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:26:00,460 INFO L225 Difference]: With dead ends: 3131 [2024-11-19 06:26:00,460 INFO L226 Difference]: Without dead ends: 3116 [2024-11-19 06:26:00,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:26:00,461 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 347 mSDsluCounter, 3648 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 4028 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:26:00,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 4028 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 746 Invalid, 1 Unknown, 0 Unchecked, 18.4s Time] [2024-11-19 06:26:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2024-11-19 06:26:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 2750. [2024-11-19 06:26:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 2596 states have (on average 1.2646379044684128) internal successors, (3283), 2620 states have internal predecessors, (3283), 108 states have call successors, (108), 41 states have call predecessors, (108), 44 states have return successors, (117), 88 states have call predecessors, (117), 104 states have call successors, (117) [2024-11-19 06:26:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3508 transitions. [2024-11-19 06:26:00,509 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3508 transitions. Word has length 178 [2024-11-19 06:26:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:26:00,510 INFO L471 AbstractCegarLoop]: Abstraction has 2750 states and 3508 transitions. [2024-11-19 06:26:00,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 06:26:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3508 transitions. [2024-11-19 06:26:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-19 06:26:00,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:00,512 INFO L215 NwaCegarLoop]: trace histogram [68, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:26:00,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 06:26:00,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:00,713 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:00,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:00,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1522585044, now seen corresponding path program 4 times [2024-11-19 06:26:00,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:00,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283590330] [2024-11-19 06:26:00,714 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 06:26:00,715 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-19 06:26:00,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:00,716 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:26:00,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 06:26:02,773 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 06:26:02,773 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:26:02,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:26:02,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-19 06:26:02,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:26:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-19 06:26:03,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:03,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283590330] [2024-11-19 06:26:03,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283590330] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:26:03,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:26:03,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:26:03,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793341939] [2024-11-19 06:26:03,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:26:03,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:26:03,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:03,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:26:03,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:26:03,161 INFO L87 Difference]: Start difference. First operand 2750 states and 3508 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 06:26:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:26:03,356 INFO L93 Difference]: Finished difference Result 2780 states and 3528 transitions. [2024-11-19 06:26:03,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:26:03,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 179 [2024-11-19 06:26:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:26:03,366 INFO L225 Difference]: With dead ends: 2780 [2024-11-19 06:26:03,366 INFO L226 Difference]: Without dead ends: 2750 [2024-11-19 06:26:03,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:26:03,367 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 5 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:26:03,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 977 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:26:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2024-11-19 06:26:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2750. [2024-11-19 06:26:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 2596 states have (on average 1.2588597842835132) internal successors, (3268), 2620 states have internal predecessors, (3268), 108 states have call successors, (108), 41 states have call predecessors, (108), 44 states have return successors, (117), 88 states have call predecessors, (117), 104 states have call successors, (117) [2024-11-19 06:26:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3493 transitions. [2024-11-19 06:26:03,433 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3493 transitions. Word has length 179 [2024-11-19 06:26:03,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:26:03,434 INFO L471 AbstractCegarLoop]: Abstraction has 2750 states and 3493 transitions. [2024-11-19 06:26:03,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 06:26:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3493 transitions. [2024-11-19 06:26:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-19 06:26:03,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:03,436 INFO L215 NwaCegarLoop]: trace histogram [71, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:26:03,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 06:26:03,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:03,637 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:03,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash 251784997, now seen corresponding path program 5 times [2024-11-19 06:26:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:03,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198040762] [2024-11-19 06:26:03,639 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 06:26:03,639 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-19 06:26:03,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:03,640 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:26:03,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 06:26:09,963 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-11-19 06:26:09,963 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:26:10,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 06:26:10,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1446 proven. 276 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2024-11-19 06:26:10,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:26:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1083 proven. 399 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2024-11-19 06:26:12,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:12,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198040762] [2024-11-19 06:26:12,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198040762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:26:12,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:26:12,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-19 06:26:12,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316461786] [2024-11-19 06:26:12,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:26:12,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-19 06:26:12,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:12,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 06:26:12,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 06:26:12,990 INFO L87 Difference]: Start difference. First operand 2750 states and 3493 transitions. Second operand has 52 states, 52 states have (on average 2.769230769230769) internal successors, (144), 52 states have internal predecessors, (144), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)