./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:32:17,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:32:17,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-14 17:32:17,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:32:17,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:32:18,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:32:18,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:32:18,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:32:18,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:32:18,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:32:18,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:32:18,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:32:18,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:32:18,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:32:18,011 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:32:18,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:32:18,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:32:18,012 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:32:18,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:32:18,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:32:18,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:32:18,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:32:18,017 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:32:18,017 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:32:18,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:32:18,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:32:18,017 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:32:18,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:32:18,018 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:32:18,018 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:32:18,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:32:18,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:32:18,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:32:18,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:32:18,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:32:18,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:32:18,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:32:18,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:32:18,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:32:18,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:32:18,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:32:18,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:32:18,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:32:18,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:32:18,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:32:18,023 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-10-14 17:32:18,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:32:18,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:32:18,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:32:18,318 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:32:18,318 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:32:18,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.i [2024-10-14 17:32:19,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:32:20,166 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:32:20,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.i [2024-10-14 17:32:20,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/577727f7e/37a11a2db3bb4ddbbc56b7a89645a9a5/FLAG623476802 [2024-10-14 17:32:20,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/577727f7e/37a11a2db3bb4ddbbc56b7a89645a9a5 [2024-10-14 17:32:20,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:32:20,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:32:20,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:32:20,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:32:20,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:32:20,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:32:20" (1/1) ... [2024-10-14 17:32:20,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325ecda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:20, skipping insertion in model container [2024-10-14 17:32:20,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:32:20" (1/1) ... [2024-10-14 17:32:20,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:32:20,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:32:20,787 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-10-14 17:32:20,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@e1b28aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:20, skipping insertion in model container [2024-10-14 17:32:20,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:32:20,788 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:32:20,790 INFO L158 Benchmark]: Toolchain (without parser) took 585.31ms. Allocated memory is still 163.6MB. Free memory was 131.3MB in the beginning and 110.4MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 17:32:20,790 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 125.8MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:32:20,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.27ms. Allocated memory is still 163.6MB. Free memory was 130.7MB in the beginning and 110.4MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 17:32:20,793 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 125.8MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 583.27ms. Allocated memory is still 163.6MB. Free memory was 130.7MB in the beginning and 110.4MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 739]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:32:22,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:32:22,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-14 17:32:22,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:32:22,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:32:22,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:32:22,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:32:22,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:32:22,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:32:22,996 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:32:22,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:32:22,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:32:22,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:32:22,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:32:22,999 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:32:23,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:32:23,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:32:23,000 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:32:23,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:32:23,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:32:23,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:32:23,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:32:23,002 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:32:23,002 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:32:23,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:32:23,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:32:23,003 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:32:23,003 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:32:23,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:32:23,004 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:32:23,004 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:32:23,004 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:32:23,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:32:23,005 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:32:23,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:32:23,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:32:23,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:32:23,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:32:23,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:32:23,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:32:23,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:32:23,007 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:32:23,007 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:32:23,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:32:23,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:32:23,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:32:23,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:32:23,008 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:32:23,008 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-10-14 17:32:23,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:32:23,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:32:23,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:32:23,377 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:32:23,378 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:32:23,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.i [2024-10-14 17:32:24,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:32:25,261 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:32:25,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.i [2024-10-14 17:32:25,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7684108/e39c01de159f4fe89c05fa00a18393e4/FLAGb7c42d2dc [2024-10-14 17:32:25,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7684108/e39c01de159f4fe89c05fa00a18393e4 [2024-10-14 17:32:25,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:32:25,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:32:25,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:32:25,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:32:25,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:32:25,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:32:25" (1/1) ... [2024-10-14 17:32:25,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62547c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:25, skipping insertion in model container [2024-10-14 17:32:25,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:32:25" (1/1) ... [2024-10-14 17:32:25,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:32:26,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:32:26,184 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:32:26,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:32:26,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:32:26,323 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:32:26,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:32:26,454 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:32:26,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26 WrapperNode [2024-10-14 17:32:26,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:32:26,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:32:26,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:32:26,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:32:26,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26" (1/1) ... [2024-10-14 17:32:26,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26" (1/1) ... [2024-10-14 17:32:26,583 INFO L138 Inliner]: procedures = 180, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1031 [2024-10-14 17:32:26,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:32:26,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:32:26,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:32:26,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:32:26,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26" (1/1) ... [2024-10-14 17:32:26,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26" (1/1) ... [2024-10-14 17:32:26,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26" (1/1) ... [2024-10-14 17:32:26,674 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-14 17:32:26,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26" (1/1) ... [2024-10-14 17:32:26,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26" (1/1) ... [2024-10-14 17:32:26,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26" (1/1) ... [2024-10-14 17:32:26,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26" (1/1) ... [2024-10-14 17:32:26,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26" (1/1) ... [2024-10-14 17:32:26,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26" (1/1) ... [2024-10-14 17:32:26,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:32:26,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:32:26,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:32:26,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:32:26,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26" (1/1) ... [2024-10-14 17:32:26,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:32:26,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:32:26,805 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-10-14 17:32:26,811 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-10-14 17:32:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 17:32:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 17:32:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 17:32:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:32:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 17:32:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 17:32:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 17:32:26,863 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 17:32:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 17:32:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 17:32:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 17:32:26,863 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 17:32:26,863 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 17:32:26,863 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 17:32:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:32:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:32:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:32:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:32:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:32:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:32:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:32:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:32:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:32:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:32:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 17:32:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 17:32:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:32:26,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:32:26,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:32:26,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 17:32:26,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:32:26,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:32:27,094 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:32:27,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:32:34,548 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-14 17:32:34,549 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:32:34,591 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:32:34,593 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-14 17:32:34,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:32:34 BoogieIcfgContainer [2024-10-14 17:32:34,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:32:34,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:32:34,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:32:34,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:32:34,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:32:25" (1/3) ... [2024-10-14 17:32:34,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795badad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:32:34, skipping insertion in model container [2024-10-14 17:32:34,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:32:26" (2/3) ... [2024-10-14 17:32:34,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795badad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:32:34, skipping insertion in model container [2024-10-14 17:32:34,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:32:34" (3/3) ... [2024-10-14 17:32:34,604 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test3-1.i [2024-10-14 17:32:34,622 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:32:34,622 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 17:32:34,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:32:34,673 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;@50a8f3da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:32:34,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 17:32:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 188 states have (on average 1.675531914893617) internal successors, (315), 191 states have internal predecessors, (315), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 17:32:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 17:32:34,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:32:34,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 17:32:34,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:32:34,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:32:34,691 INFO L85 PathProgramCache]: Analyzing trace with hash 838735, now seen corresponding path program 1 times [2024-10-14 17:32:34,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:32:34,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311200946] [2024-10-14 17:32:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:32:34,701 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-10-14 17:32:34,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:32:34,703 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-10-14 17:32:34,724 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-10-14 17:32:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:32:34,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:32:34,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:32:34,995 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_20| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_20|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_20| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-14 17:32:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:32:34,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:32:34,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:32:34,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311200946] [2024-10-14 17:32:34,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311200946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:32:34,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:32:34,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:32:35,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365280609] [2024-10-14 17:32:35,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:32:35,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:32:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:32:35,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:32:35,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 17:32:35,029 INFO L87 Difference]: Start difference. First operand has 198 states, 188 states have (on average 1.675531914893617) internal successors, (315), 191 states have internal predecessors, (315), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:32:39,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:32:39,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:32:39,528 INFO L93 Difference]: Finished difference Result 292 states and 383 transitions. [2024-10-14 17:32:39,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:32:39,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 17:32:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:32:39,542 INFO L225 Difference]: With dead ends: 292 [2024-10-14 17:32:39,542 INFO L226 Difference]: Without dead ends: 290 [2024-10-14 17:32:39,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 17:32:39,546 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 120 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 384 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:32:39,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 475 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 1 Unknown, 384 Unchecked, 4.4s Time] [2024-10-14 17:32:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-14 17:32:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 196. [2024-10-14 17:32:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 189 states have internal predecessors, (243), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 17:32:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 253 transitions. [2024-10-14 17:32:39,596 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 253 transitions. Word has length 3 [2024-10-14 17:32:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:32:39,596 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 253 transitions. [2024-10-14 17:32:39,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:32:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 253 transitions. [2024-10-14 17:32:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 17:32:39,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:32:39,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:32:39,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 17:32:39,800 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-10-14 17:32:39,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:32:39,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:32:39,801 INFO L85 PathProgramCache]: Analyzing trace with hash 661190916, now seen corresponding path program 1 times [2024-10-14 17:32:39,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:32:39,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043119466] [2024-10-14 17:32:39,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:32:39,802 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-10-14 17:32:39,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:32:39,804 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-10-14 17:32:39,805 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-10-14 17:32:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:32:39,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:32:39,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:32:40,108 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_21| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_21| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_21|)))) is different from true [2024-10-14 17:32:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:32:40,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:32:40,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:32:40,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043119466] [2024-10-14 17:32:40,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043119466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:32:40,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:32:40,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:32:40,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742241707] [2024-10-14 17:32:40,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:32:40,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:32:40,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:32:40,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:32:40,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 17:32:40,112 INFO L87 Difference]: Start difference. First operand 196 states and 253 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:32:44,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:32:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:32:44,606 INFO L93 Difference]: Finished difference Result 291 states and 380 transitions. [2024-10-14 17:32:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:32:44,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 17:32:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:32:44,608 INFO L225 Difference]: With dead ends: 291 [2024-10-14 17:32:44,609 INFO L226 Difference]: Without dead ends: 289 [2024-10-14 17:32:44,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 17:32:44,610 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 112 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 379 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:32:44,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 475 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 1 Unknown, 379 Unchecked, 4.5s Time] [2024-10-14 17:32:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-14 17:32:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 265. [2024-10-14 17:32:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 254 states have (on average 1.3070866141732282) internal successors, (332), 256 states have internal predecessors, (332), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 17:32:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 346 transitions. [2024-10-14 17:32:44,634 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 346 transitions. Word has length 11 [2024-10-14 17:32:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:32:44,635 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 346 transitions. [2024-10-14 17:32:44,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:32:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 346 transitions. [2024-10-14 17:32:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:32:44,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:32:44,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:32:44,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 17:32:44,836 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-10-14 17:32:44,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:32:44,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:32:44,838 INFO L85 PathProgramCache]: Analyzing trace with hash 904417889, now seen corresponding path program 1 times [2024-10-14 17:32:44,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:32:44,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721122161] [2024-10-14 17:32:44,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:32:44,838 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-10-14 17:32:44,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:32:44,839 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-10-14 17:32:44,840 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-10-14 17:32:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:32:44,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:32:44,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:32:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:32:45,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:32:45,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:32:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721122161] [2024-10-14 17:32:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721122161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:32:45,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:32:45,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:32:45,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691688069] [2024-10-14 17:32:45,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:32:45,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:32:45,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:32:45,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:32:45,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:32:45,104 INFO L87 Difference]: Start difference. First operand 265 states and 346 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-10-14 17:32:49,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:32:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:32:51,586 INFO L93 Difference]: Finished difference Result 355 states and 462 transitions. [2024-10-14 17:32:51,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:32:51,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2024-10-14 17:32:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:32:51,590 INFO L225 Difference]: With dead ends: 355 [2024-10-14 17:32:51,590 INFO L226 Difference]: Without dead ends: 353 [2024-10-14 17:32:51,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-10-14 17:32:51,592 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 136 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:32:51,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 672 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2024-10-14 17:32:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-14 17:32:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 352. [2024-10-14 17:32:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 341 states have (on average 1.3049853372434017) internal successors, (445), 344 states have internal predecessors, (445), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 17:32:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 459 transitions. [2024-10-14 17:32:51,623 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 459 transitions. Word has length 14 [2024-10-14 17:32:51,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:32:51,623 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 459 transitions. [2024-10-14 17:32:51,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-10-14 17:32:51,623 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 459 transitions. [2024-10-14 17:32:51,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 17:32:51,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:32:51,626 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-10-14 17:32:51,632 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-10-14 17:32:51,831 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-10-14 17:32:51,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:32:51,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:32:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash 605623697, now seen corresponding path program 1 times [2024-10-14 17:32:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:32:51,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528353974] [2024-10-14 17:32:51,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:32:51,833 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-10-14 17:32:51,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:32:51,836 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-10-14 17:32:51,837 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-10-14 17:32:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:32:52,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:32:52,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:32:52,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:32:52,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:32:52,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:32:52,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528353974] [2024-10-14 17:32:52,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528353974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:32:52,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:32:52,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:32:52,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320207139] [2024-10-14 17:32:52,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:32:52,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:32:52,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:32:52,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:32:52,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:32:52,072 INFO L87 Difference]: Start difference. First operand 352 states and 459 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-10-14 17:32:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:32:52,265 INFO L93 Difference]: Finished difference Result 361 states and 444 transitions. [2024-10-14 17:32:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:32:52,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 50 [2024-10-14 17:32:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:32:52,268 INFO L225 Difference]: With dead ends: 361 [2024-10-14 17:32:52,268 INFO L226 Difference]: Without dead ends: 361 [2024-10-14 17:32:52,268 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-10-14 17:32:52,269 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 30 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:32:52,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 643 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:32:52,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-14 17:32:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-10-14 17:32:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 350 states have (on average 1.2285714285714286) internal successors, (430), 353 states have internal predecessors, (430), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 17:32:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 444 transitions. [2024-10-14 17:32:52,280 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 444 transitions. Word has length 50 [2024-10-14 17:32:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:32:52,280 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 444 transitions. [2024-10-14 17:32:52,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-10-14 17:32:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 444 transitions. [2024-10-14 17:32:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 17:32:52,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:32:52,282 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-10-14 17:32:52,288 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-10-14 17:32:52,482 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-10-14 17:32:52,483 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:32:52,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:32:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1020800389, now seen corresponding path program 1 times [2024-10-14 17:32:52,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:32:52,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798082659] [2024-10-14 17:32:52,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:32:52,484 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-10-14 17:32:52,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:32:52,488 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-10-14 17:32:52,497 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-10-14 17:32:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:32:52,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:32:52,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:32:52,719 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:32:52,720 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:32:52,720 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:32:52,727 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-10-14 17:32:52,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:32:52,831 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-10-14 17:32:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:32:52,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:32:52,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:32:52,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798082659] [2024-10-14 17:32:52,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798082659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:32:52,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:32:52,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:32:52,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649926373] [2024-10-14 17:32:52,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:32:52,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:32:52,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:32:52,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:32:52,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:32:52,918 INFO L87 Difference]: Start difference. First operand 361 states and 444 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-10-14 17:32:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:32:53,583 INFO L93 Difference]: Finished difference Result 362 states and 451 transitions. [2024-10-14 17:32:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:32:53,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 50 [2024-10-14 17:32:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:32:53,585 INFO L225 Difference]: With dead ends: 362 [2024-10-14 17:32:53,585 INFO L226 Difference]: Without dead ends: 359 [2024-10-14 17:32:53,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:32:53,586 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 108 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:32:53,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 905 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:32:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-14 17:32:53,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 312. [2024-10-14 17:32:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 302 states have (on average 1.2450331125827814) internal successors, (376), 305 states have internal predecessors, (376), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:32:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 388 transitions. [2024-10-14 17:32:53,597 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 388 transitions. Word has length 50 [2024-10-14 17:32:53,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:32:53,598 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 388 transitions. [2024-10-14 17:32:53,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-10-14 17:32:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 388 transitions. [2024-10-14 17:32:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 17:32:53,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:32:53,600 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 17:32:53,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 17:32:53,801 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-10-14 17:32:53,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:32:53,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:32:53,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2131991653, now seen corresponding path program 1 times [2024-10-14 17:32:53,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:32:53,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250169426] [2024-10-14 17:32:53,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:32:53,803 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-10-14 17:32:53,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:32:53,807 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-10-14 17:32:53,809 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-10-14 17:32:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:32:54,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:32:54,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:32:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:32:54,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:32:54,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:32:54,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250169426] [2024-10-14 17:32:54,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250169426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:32:54,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:32:54,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:32:54,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378032632] [2024-10-14 17:32:54,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:32:54,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:32:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:32:54,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:32:54,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:32:54,274 INFO L87 Difference]: Start difference. First operand 312 states and 388 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:32:54,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:32:54,441 INFO L93 Difference]: Finished difference Result 318 states and 378 transitions. [2024-10-14 17:32:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:32:54,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2024-10-14 17:32:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:32:54,443 INFO L225 Difference]: With dead ends: 318 [2024-10-14 17:32:54,443 INFO L226 Difference]: Without dead ends: 318 [2024-10-14 17:32:54,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 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-10-14 17:32:54,444 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 33 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:32:54,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 607 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:32:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-14 17:32:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-10-14 17:32:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 311 states have internal predecessors, (366), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:32:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 378 transitions. [2024-10-14 17:32:54,451 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 378 transitions. Word has length 80 [2024-10-14 17:32:54,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:32:54,451 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 378 transitions. [2024-10-14 17:32:54,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:32:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 378 transitions. [2024-10-14 17:32:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 17:32:54,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:32:54,453 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 17:32:54,465 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 (7)] Forceful destruction successful, exit code 0 [2024-10-14 17:32:54,653 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-10-14 17:32:54,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:32:54,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:32:54,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1274875893, now seen corresponding path program 1 times [2024-10-14 17:32:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:32:54,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025716650] [2024-10-14 17:32:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:32:54,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-10-14 17:32:54,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:32:54,656 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-10-14 17:32:54,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 (8)] Waiting until timeout for monitored process [2024-10-14 17:32:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:32:55,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:32:55,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:32:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:32:55,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:32:55,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:32:55,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025716650] [2024-10-14 17:32:55,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025716650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:32:55,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:32:55,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:32:55,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838524888] [2024-10-14 17:32:55,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:32:55,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:32:55,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:32:55,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:32:55,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:32:55,252 INFO L87 Difference]: Start difference. First operand 318 states and 378 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:32:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:32:55,346 INFO L93 Difference]: Finished difference Result 306 states and 358 transitions. [2024-10-14 17:32:55,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:32:55,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2024-10-14 17:32:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:32:55,348 INFO L225 Difference]: With dead ends: 306 [2024-10-14 17:32:55,348 INFO L226 Difference]: Without dead ends: 306 [2024-10-14 17:32:55,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:32:55,349 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 8 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:32:55,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 607 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:32:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-14 17:32:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-10-14 17:32:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 296 states have (on average 1.1689189189189189) internal successors, (346), 299 states have internal predecessors, (346), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:32:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 358 transitions. [2024-10-14 17:32:55,356 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 358 transitions. Word has length 80 [2024-10-14 17:32:55,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:32:55,357 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 358 transitions. [2024-10-14 17:32:55,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:32:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 358 transitions. [2024-10-14 17:32:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 17:32:55,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:32:55,360 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 17:32:55,375 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-10-14 17:32:55,560 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-10-14 17:32:55,561 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:32:55,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:32:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1419887249, now seen corresponding path program 1 times [2024-10-14 17:32:55,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:32:55,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716891772] [2024-10-14 17:32:55,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:32:55,562 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-10-14 17:32:55,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:32:55,563 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-10-14 17:32:55,564 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-10-14 17:32:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:32:55,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:32:55,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:32:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:32:55,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:32:55,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:32:55,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716891772] [2024-10-14 17:32:55,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716891772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:32:55,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:32:55,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:32:55,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312771538] [2024-10-14 17:32:55,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:32:55,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:32:55,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:32:55,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:32:55,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:32:55,991 INFO L87 Difference]: Start difference. First operand 306 states and 358 transitions. Second operand has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:32:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:32:56,039 INFO L93 Difference]: Finished difference Result 308 states and 361 transitions. [2024-10-14 17:32:56,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:32:56,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 80 [2024-10-14 17:32:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:32:56,043 INFO L225 Difference]: With dead ends: 308 [2024-10-14 17:32:56,043 INFO L226 Difference]: Without dead ends: 308 [2024-10-14 17:32:56,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 77 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-10-14 17:32:56,044 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:32:56,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 662 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:32:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-14 17:32:56,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-14 17:32:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 297 states have (on average 1.1717171717171717) internal successors, (348), 301 states have internal predecessors, (348), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-14 17:32:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 361 transitions. [2024-10-14 17:32:56,060 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 361 transitions. Word has length 80 [2024-10-14 17:32:56,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:32:56,061 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 361 transitions. [2024-10-14 17:32:56,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:32:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 361 transitions. [2024-10-14 17:32:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 17:32:56,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:32:56,063 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:32:56,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-14 17:32:56,263 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-10-14 17:32:56,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:32:56,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:32:56,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1509470323, now seen corresponding path program 1 times [2024-10-14 17:32:56,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:32:56,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365558408] [2024-10-14 17:32:56,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:32:56,265 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-10-14 17:32:56,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:32:56,266 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-10-14 17:32:56,268 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-10-14 17:32:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:32:56,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:32:56,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:32:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:32:56,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:32:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:32:56,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:32:56,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365558408] [2024-10-14 17:32:56,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365558408] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:32:56,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:32:56,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 17:32:56,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615417333] [2024-10-14 17:32:56,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:32:56,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:32:56,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:32:56,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:32:56,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:32:56,800 INFO L87 Difference]: Start difference. First operand 308 states and 361 transitions. Second operand has 8 states, 6 states have (on average 14.0) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:32:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:32:57,027 INFO L93 Difference]: Finished difference Result 317 states and 375 transitions. [2024-10-14 17:32:57,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:32:57,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 14.0) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2024-10-14 17:32:57,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:32:57,029 INFO L225 Difference]: With dead ends: 317 [2024-10-14 17:32:57,030 INFO L226 Difference]: Without dead ends: 317 [2024-10-14 17:32:57,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 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-10-14 17:32:57,030 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 5 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:32:57,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 880 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:32:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-14 17:32:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 316. [2024-10-14 17:32:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 304 states have (on average 1.1875) internal successors, (361), 308 states have internal predecessors, (361), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-14 17:32:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 374 transitions. [2024-10-14 17:32:57,037 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 374 transitions. Word has length 82 [2024-10-14 17:32:57,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:32:57,037 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 374 transitions. [2024-10-14 17:32:57,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 14.0) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:32:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 374 transitions. [2024-10-14 17:32:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 17:32:57,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:32:57,039 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-14 17:32:57,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 17:32:57,239 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-10-14 17:32:57,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:32:57,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:32:57,240 INFO L85 PathProgramCache]: Analyzing trace with hash -513738577, now seen corresponding path program 2 times [2024-10-14 17:32:57,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:32:57,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442209857] [2024-10-14 17:32:57,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:32:57,240 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-10-14 17:32:57,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:32:57,241 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-10-14 17:32:57,242 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-10-14 17:32:57,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:32:57,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:32:57,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 17:32:57,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:32:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:32:57,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:32:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:32:58,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:32:58,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442209857] [2024-10-14 17:32:58,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442209857] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:32:58,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:32:58,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 17:32:58,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570410610] [2024-10-14 17:32:58,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:32:58,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:32:58,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:32:58,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:32:58,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:32:58,078 INFO L87 Difference]: Start difference. First operand 316 states and 374 transitions. Second operand has 14 states, 12 states have (on average 7.5) internal successors, (90), 14 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:32:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:32:58,618 INFO L93 Difference]: Finished difference Result 328 states and 393 transitions. [2024-10-14 17:32:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 17:32:58,619 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 14 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 86 [2024-10-14 17:32:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:32:58,621 INFO L225 Difference]: With dead ends: 328 [2024-10-14 17:32:58,621 INFO L226 Difference]: Without dead ends: 326 [2024-10-14 17:32:58,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 17:32:58,622 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 8 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:32:58,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2409 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:32:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-14 17:32:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2024-10-14 17:32:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 313 states have (on average 1.1916932907348243) internal successors, (373), 317 states have internal predecessors, (373), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-14 17:32:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 386 transitions. [2024-10-14 17:32:58,629 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 386 transitions. Word has length 86 [2024-10-14 17:32:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:32:58,629 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 386 transitions. [2024-10-14 17:32:58,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 14 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:32:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 386 transitions. [2024-10-14 17:32:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 17:32:58,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:32:58,631 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-10-14 17:32:58,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 17:32:58,831 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-10-14 17:32:58,831 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:32:58,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:32:58,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1909119777, now seen corresponding path program 3 times [2024-10-14 17:32:58,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:32:58,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292950373] [2024-10-14 17:32:58,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:32:58,833 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-10-14 17:32:58,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:32:58,834 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-10-14 17:32:58,835 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-10-14 17:32:59,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:32:59,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:32:59,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:32:59,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:32:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-14 17:32:59,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:32:59,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:32:59,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292950373] [2024-10-14 17:32:59,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292950373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:32:59,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:32:59,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:32:59,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540535382] [2024-10-14 17:32:59,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:32:59,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:32:59,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:32:59,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:32:59,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:32:59,495 INFO L87 Difference]: Start difference. First operand 325 states and 386 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:33:03,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:33:07,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:33:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:09,732 INFO L93 Difference]: Finished difference Result 417 states and 499 transitions. [2024-10-14 17:33:09,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:33:09,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2024-10-14 17:33:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:09,735 INFO L225 Difference]: With dead ends: 417 [2024-10-14 17:33:09,735 INFO L226 Difference]: Without dead ends: 417 [2024-10-14 17:33:09,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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-10-14 17:33:09,736 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 422 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:09,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 379 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2024-10-14 17:33:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-14 17:33:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2024-10-14 17:33:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 401 states have (on average 1.1970074812967582) internal successors, (480), 406 states have internal predecessors, (480), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 17:33:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 495 transitions. [2024-10-14 17:33:09,747 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 495 transitions. Word has length 95 [2024-10-14 17:33:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:09,748 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 495 transitions. [2024-10-14 17:33:09,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:33:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 495 transitions. [2024-10-14 17:33:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 17:33:09,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:09,749 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-10-14 17:33:09,761 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-10-14 17:33:09,953 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-10-14 17:33:09,954 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:09,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:09,954 INFO L85 PathProgramCache]: Analyzing trace with hash 716201764, now seen corresponding path program 1 times [2024-10-14 17:33:09,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:09,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228671620] [2024-10-14 17:33:09,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:33:09,955 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-10-14 17:33:09,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:09,956 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-10-14 17:33:09,957 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-10-14 17:33:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:33:10,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 17:33:10,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 17:33:10,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:33:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 17:33:11,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:33:11,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228671620] [2024-10-14 17:33:11,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228671620] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:33:11,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:33:11,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 17:33:11,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323237500] [2024-10-14 17:33:11,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:33:11,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 17:33:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:33:11,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 17:33:11,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 17:33:11,522 INFO L87 Difference]: Start difference. First operand 414 states and 495 transitions. Second operand has 26 states, 24 states have (on average 4.333333333333333) internal successors, (104), 26 states have internal predecessors, (104), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:33:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:13,801 INFO L93 Difference]: Finished difference Result 435 states and 532 transitions. [2024-10-14 17:33:13,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 17:33:13,802 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.333333333333333) internal successors, (104), 26 states have internal predecessors, (104), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 98 [2024-10-14 17:33:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:13,804 INFO L225 Difference]: With dead ends: 435 [2024-10-14 17:33:13,804 INFO L226 Difference]: Without dead ends: 433 [2024-10-14 17:33:13,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 17:33:13,806 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 14 mSDsluCounter, 2630 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:13,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2852 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 17:33:13,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-14 17:33:13,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 432. [2024-10-14 17:33:13,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 419 states have (on average 1.2028639618138426) internal successors, (504), 424 states have internal predecessors, (504), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 17:33:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 519 transitions. [2024-10-14 17:33:13,815 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 519 transitions. Word has length 98 [2024-10-14 17:33:13,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:13,815 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 519 transitions. [2024-10-14 17:33:13,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.333333333333333) internal successors, (104), 26 states have internal predecessors, (104), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:33:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 519 transitions. [2024-10-14 17:33:13,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 17:33:13,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:13,817 INFO L215 NwaCegarLoop]: trace histogram [33, 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] [2024-10-14 17:33:13,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 17:33:14,017 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-10-14 17:33:14,018 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:14,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:14,018 INFO L85 PathProgramCache]: Analyzing trace with hash -393740060, now seen corresponding path program 2 times [2024-10-14 17:33:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:14,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839021116] [2024-10-14 17:33:14,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:33:14,019 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-10-14 17:33:14,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:14,022 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-10-14 17:33:14,023 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-10-14 17:33:14,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:33:14,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:33:14,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:33:14,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-14 17:33:15,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:33:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-14 17:33:17,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:33:17,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839021116] [2024-10-14 17:33:17,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839021116] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:33:17,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:33:17,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 17:33:17,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574423662] [2024-10-14 17:33:17,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:33:17,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 17:33:17,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:33:17,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 17:33:17,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 17:33:17,614 INFO L87 Difference]: Start difference. First operand 432 states and 519 transitions. Second operand has 50 states, 48 states have (on average 2.6666666666666665) internal successors, (128), 50 states have internal predecessors, (128), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:33:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:26,142 INFO L93 Difference]: Finished difference Result 469 states and 588 transitions. [2024-10-14 17:33:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 17:33:26,143 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.6666666666666665) internal successors, (128), 50 states have internal predecessors, (128), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 116 [2024-10-14 17:33:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:26,144 INFO L225 Difference]: With dead ends: 469 [2024-10-14 17:33:26,144 INFO L226 Difference]: Without dead ends: 467 [2024-10-14 17:33:26,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 17:33:26,147 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 26 mSDsluCounter, 5257 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5479 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:26,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5479 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-14 17:33:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-14 17:33:26,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 466. [2024-10-14 17:33:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 453 states have (on average 1.2141280353200883) internal successors, (550), 458 states have internal predecessors, (550), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 17:33:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 565 transitions. [2024-10-14 17:33:26,156 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 565 transitions. Word has length 116 [2024-10-14 17:33:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:26,157 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 565 transitions. [2024-10-14 17:33:26,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.6666666666666665) internal successors, (128), 50 states have internal predecessors, (128), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:33:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 565 transitions. [2024-10-14 17:33:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 17:33:26,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:26,159 INFO L215 NwaCegarLoop]: trace histogram [67, 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] [2024-10-14 17:33:26,178 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-10-14 17:33:26,359 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-10-14 17:33:26,359 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:26,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:26,360 INFO L85 PathProgramCache]: Analyzing trace with hash -89779740, now seen corresponding path program 3 times [2024-10-14 17:33:26,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:26,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634416904] [2024-10-14 17:33:26,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:33:26,361 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-10-14 17:33:26,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:26,363 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-10-14 17:33:26,364 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-10-14 17:33:26,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:33:26,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:33:26,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 17:33:26,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:27,516 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:33:27,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:33:27,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:33:27,519 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-10-14 17:33:27,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:33:27,600 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-10-14 17:33:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-14 17:33:27,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:33:27,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:33:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634416904] [2024-10-14 17:33:27,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634416904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:33:27,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:33:27,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:33:27,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371599202] [2024-10-14 17:33:27,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:33:27,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:33:27,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:33:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:33:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:33:27,634 INFO L87 Difference]: Start difference. First operand 466 states and 565 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:33:27,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:27,901 INFO L93 Difference]: Finished difference Result 576 states and 699 transitions. [2024-10-14 17:33:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:33:27,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 150 [2024-10-14 17:33:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:27,904 INFO L225 Difference]: With dead ends: 576 [2024-10-14 17:33:27,904 INFO L226 Difference]: Without dead ends: 576 [2024-10-14 17:33:27,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:33:27,905 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 572 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:27,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 609 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:33:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-14 17:33:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 468. [2024-10-14 17:33:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 455 states have (on average 1.213186813186813) internal successors, (552), 460 states have internal predecessors, (552), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 17:33:27,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 567 transitions. [2024-10-14 17:33:27,919 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 567 transitions. Word has length 150 [2024-10-14 17:33:27,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:27,920 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 567 transitions. [2024-10-14 17:33:27,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:33:27,920 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 567 transitions. [2024-10-14 17:33:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-14 17:33:27,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:27,922 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:33:27,937 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 (15)] Forceful destruction successful, exit code 0 [2024-10-14 17:33:28,126 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-10-14 17:33:28,127 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:28,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:28,128 INFO L85 PathProgramCache]: Analyzing trace with hash 953365714, now seen corresponding path program 1 times [2024-10-14 17:33:28,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:28,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397386871] [2024-10-14 17:33:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:33:28,129 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-10-14 17:33:28,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:28,132 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-10-14 17:33:28,133 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-10-14 17:33:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:33:29,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 17:33:29,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:33:30,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:33:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:33:32,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:33:32,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397386871] [2024-10-14 17:33:32,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397386871] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:33:32,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:33:32,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-14 17:33:32,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384307059] [2024-10-14 17:33:32,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:33:32,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 17:33:32,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:33:32,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 17:33:32,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 17:33:32,809 INFO L87 Difference]: Start difference. First operand 468 states and 567 transitions. Second operand has 52 states, 50 states have (on average 3.42) internal successors, (171), 52 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:33:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:39,720 INFO L93 Difference]: Finished difference Result 495 states and 619 transitions. [2024-10-14 17:33:39,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-14 17:33:39,721 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.42) internal successors, (171), 52 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 194 [2024-10-14 17:33:39,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:39,723 INFO L225 Difference]: With dead ends: 495 [2024-10-14 17:33:39,723 INFO L226 Difference]: Without dead ends: 495 [2024-10-14 17:33:39,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-14 17:33:39,726 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 26 mSDsluCounter, 5670 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5891 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:39,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5891 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 17:33:39,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-14 17:33:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2024-10-14 17:33:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 480 states have (on average 1.2541666666666667) internal successors, (602), 485 states have internal predecessors, (602), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 17:33:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 617 transitions. [2024-10-14 17:33:39,736 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 617 transitions. Word has length 194 [2024-10-14 17:33:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:39,737 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 617 transitions. [2024-10-14 17:33:39,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.42) internal successors, (171), 52 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:33:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 617 transitions. [2024-10-14 17:33:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-14 17:33:39,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:39,739 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:33:39,762 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-10-14 17:33:39,940 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-10-14 17:33:39,941 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:39,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:39,941 INFO L85 PathProgramCache]: Analyzing trace with hash 135316740, now seen corresponding path program 2 times [2024-10-14 17:33:39,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:39,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236083051] [2024-10-14 17:33:39,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:33:39,942 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-10-14 17:33:39,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:39,945 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-10-14 17:33:39,947 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-10-14 17:33:41,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:33:41,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:33:41,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 17:33:41,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:33:43,290 INFO L311 TraceCheckSpWp]: Computing backward predicates...