./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:05:18,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:05:18,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-17 00:05:18,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:05:18,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:05:18,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:05:18,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:05:18,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:05:18,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:05:18,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:05:18,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:05:18,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:05:18,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:05:18,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:05:18,414 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:05:18,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:05:18,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:05:18,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:05:18,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:05:18,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:05:18,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:05:18,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:05:18,417 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:05:18,418 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:05:18,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:05:18,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:05:18,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:05:18,419 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:05:18,419 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:05:18,419 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:05:18,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:05:18,420 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:05:18,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:05:18,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:05:18,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:05:18,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:05:18,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:05:18,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:05:18,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:05:18,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:05:18,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:05:18,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:05:18,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:05:18,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:05:18,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:05:18,424 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-17 00:05:18,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:05:18,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:05:18,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:05:18,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:05:18,711 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:05:18,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-17 00:05:20,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:05:20,600 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:05:20,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-17 00:05:20,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b06b93d/58e74d59c61340d796fc1873bd4d01d9/FLAG3fa8a445a [2024-11-17 00:05:20,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b06b93d/58e74d59c61340d796fc1873bd4d01d9 [2024-11-17 00:05:20,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:05:20,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:05:20,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:05:20,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:05:20,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:05:20,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:05:20" (1/1) ... [2024-11-17 00:05:20,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa80970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:20, skipping insertion in model container [2024-11-17 00:05:20,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:05:20" (1/1) ... [2024-11-17 00:05:20,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:05:21,174 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,219 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,227 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,234 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,244 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,289 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,290 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,295 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,298 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,299 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,303 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,306 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,308 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,309 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,316 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:21,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:05:21,341 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-17 00:05:21,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@70bf3ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:21, skipping insertion in model container [2024-11-17 00:05:21,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:05:21,343 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 00:05:21,345 INFO L158 Benchmark]: Toolchain (without parser) took 692.44ms. Allocated memory is still 159.4MB. Free memory was 124.3MB in the beginning and 100.3MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-17 00:05:21,346 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 125.8MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:05:21,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 689.38ms. Allocated memory is still 159.4MB. Free memory was 123.4MB in the beginning and 100.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-17 00:05:21,348 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 125.8MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 689.38ms. Allocated memory is still 159.4MB. Free memory was 123.4MB in the beginning and 100.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 831]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:05:23,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:05:23,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-17 00:05:23,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:05:23,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:05:23,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:05:23,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:05:23,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:05:23,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:05:23,546 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:05:23,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:05:23,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:05:23,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:05:23,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:05:23,548 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:05:23,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:05:23,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:05:23,551 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:05:23,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:05:23,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:05:23,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:05:23,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:05:23,556 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:05:23,556 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:05:23,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:05:23,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:05:23,557 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:05:23,557 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:05:23,558 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:05:23,558 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:05:23,559 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:05:23,559 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:05:23,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:05:23,560 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:05:23,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:05:23,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:05:23,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:05:23,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:05:23,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:05:23,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:05:23,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:05:23,562 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:05:23,563 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:05:23,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:05:23,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:05:23,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:05:23,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:05:23,564 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-17 00:05:23,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:05:23,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:05:23,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:05:23,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:05:23,940 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:05:23,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-17 00:05:25,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:05:25,823 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:05:25,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-17 00:05:25,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8a3a1e09/369d33a5186c453894d319635bbadb24/FLAG49b39da73 [2024-11-17 00:05:25,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8a3a1e09/369d33a5186c453894d319635bbadb24 [2024-11-17 00:05:25,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:05:25,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:05:25,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:05:25,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:05:25,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:05:25,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:05:25" (1/1) ... [2024-11-17 00:05:25,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8aaf03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:25, skipping insertion in model container [2024-11-17 00:05:25,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:05:25" (1/1) ... [2024-11-17 00:05:25,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:05:26,408 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,468 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,475 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,480 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,489 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,538 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,542 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,545 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,549 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,551 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,554 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,557 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,559 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,562 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,568 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:05:26,599 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 00:05:26,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:05:26,638 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,649 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,651 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,653 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,657 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,690 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,691 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,706 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,706 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,708 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,709 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,714 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,715 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,715 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,718 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:05:26,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:05:26,730 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:05:26,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:05:26,889 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:05:26,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26 WrapperNode [2024-11-17 00:05:26,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:05:26,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:05:26,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:05:26,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:05:26,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26" (1/1) ... [2024-11-17 00:05:26,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26" (1/1) ... [2024-11-17 00:05:27,013 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1005 [2024-11-17 00:05:27,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:05:27,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:05:27,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:05:27,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:05:27,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26" (1/1) ... [2024-11-17 00:05:27,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26" (1/1) ... [2024-11-17 00:05:27,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26" (1/1) ... [2024-11-17 00:05:27,135 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-11-17 00:05:27,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26" (1/1) ... [2024-11-17 00:05:27,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26" (1/1) ... [2024-11-17 00:05:27,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26" (1/1) ... [2024-11-17 00:05:27,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26" (1/1) ... [2024-11-17 00:05:27,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26" (1/1) ... [2024-11-17 00:05:27,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26" (1/1) ... [2024-11-17 00:05:27,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:05:27,210 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:05:27,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:05:27,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:05:27,215 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26" (1/1) ... [2024-11-17 00:05:27,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:05:27,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:05:27,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:05:27,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:05:27,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 00:05:27,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 00:05:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 00:05:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 00:05:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 00:05:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 00:05:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 00:05:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 00:05:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 00:05:27,290 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 00:05:27,290 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 00:05:27,290 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 00:05:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:05:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:05:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:05:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:05:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 00:05:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 00:05:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 00:05:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:05:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 00:05:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 00:05:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 00:05:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:05:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:05:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:05:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:05:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:05:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:05:27,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:05:27,507 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:05:27,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:05:34,783 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 00:05:34,859 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2024-11-17 00:05:34,860 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:05:34,878 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:05:34,879 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:05:34,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:05:34 BoogieIcfgContainer [2024-11-17 00:05:34,880 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:05:34,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:05:34,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:05:34,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:05:34,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:05:25" (1/3) ... [2024-11-17 00:05:34,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d31ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:05:34, skipping insertion in model container [2024-11-17 00:05:34,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:05:26" (2/3) ... [2024-11-17 00:05:34,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d31ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:05:34, skipping insertion in model container [2024-11-17 00:05:34,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:05:34" (3/3) ... [2024-11-17 00:05:34,889 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test2-2.i [2024-11-17 00:05:34,903 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:05:34,903 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:05:34,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:05:34,966 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;@6e56c998, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:05:34,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:05:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 199 states have (on average 1.64321608040201) internal successors, (327), 201 states have internal predecessors, (327), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:05:34,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 00:05:34,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:34,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 00:05:34,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:34,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:34,984 INFO L85 PathProgramCache]: Analyzing trace with hash 365454364, now seen corresponding path program 1 times [2024-11-17 00:05:34,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:34,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784862796] [2024-11-17 00:05:34,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:05:34,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:34,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:35,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:05:35,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 00:05:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:05:35,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:05:35,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:35,301 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_18| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_18|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_18| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-17 00:05:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:05:35,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:05:35,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:35,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784862796] [2024-11-17 00:05:35,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784862796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:05:35,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:05:35,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:05:35,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446964682] [2024-11-17 00:05:35,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:05:35,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:05:35,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:35,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:05:35,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 00:05:35,365 INFO L87 Difference]: Start difference. First operand has 206 states, 199 states have (on average 1.64321608040201) internal successors, (327), 201 states have internal predecessors, (327), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:39,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:05:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:40,659 INFO L93 Difference]: Finished difference Result 307 states and 396 transitions. [2024-11-17 00:05:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:05:40,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-17 00:05:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:40,676 INFO L225 Difference]: With dead ends: 307 [2024-11-17 00:05:40,676 INFO L226 Difference]: Without dead ends: 302 [2024-11-17 00:05:40,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 00:05:40,682 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 128 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:40,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 496 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 1 Unknown, 397 Unchecked, 5.2s Time] [2024-11-17 00:05:40,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-17 00:05:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 202. [2024-11-17 00:05:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 196 states have (on average 1.2908163265306123) internal successors, (253), 197 states have internal predecessors, (253), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:05:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 259 transitions. [2024-11-17 00:05:40,734 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 259 transitions. Word has length 5 [2024-11-17 00:05:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:40,737 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 259 transitions. [2024-11-17 00:05:40,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 259 transitions. [2024-11-17 00:05:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:05:40,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:40,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:40,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 00:05:40,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:40,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:40,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:40,940 INFO L85 PathProgramCache]: Analyzing trace with hash 3215469, now seen corresponding path program 1 times [2024-11-17 00:05:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:40,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874193823] [2024-11-17 00:05:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:05:40,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:40,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:40,942 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:05:40,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 00:05:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:05:41,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:05:41,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:05:41,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:05:41,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:41,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874193823] [2024-11-17 00:05:41,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874193823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:05:41,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:05:41,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:05:41,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315665666] [2024-11-17 00:05:41,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:05:41,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:05:41,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:05:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:05:41,269 INFO L87 Difference]: Start difference. First operand 202 states and 259 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:41,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:41,865 INFO L93 Difference]: Finished difference Result 328 states and 420 transitions. [2024-11-17 00:05:41,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:05:41,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-17 00:05:41,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:41,868 INFO L225 Difference]: With dead ends: 328 [2024-11-17 00:05:41,868 INFO L226 Difference]: Without dead ends: 328 [2024-11-17 00:05:41,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:05:41,870 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 152 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:41,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 479 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:05:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-17 00:05:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 293. [2024-11-17 00:05:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 287 states have (on average 1.2926829268292683) internal successors, (371), 288 states have internal predecessors, (371), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:05:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 377 transitions. [2024-11-17 00:05:41,886 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 377 transitions. Word has length 16 [2024-11-17 00:05:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:41,886 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 377 transitions. [2024-11-17 00:05:41,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 377 transitions. [2024-11-17 00:05:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:05:41,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:41,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:41,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 00:05:42,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:42,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:42,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash 890719150, now seen corresponding path program 1 times [2024-11-17 00:05:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:42,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867175735] [2024-11-17 00:05:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:05:42,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:42,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:42,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:05:42,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 00:05:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:05:42,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:05:42,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:42,461 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_19| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_19| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_19|)))) is different from true [2024-11-17 00:05:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:05:42,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:05:42,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:42,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867175735] [2024-11-17 00:05:42,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867175735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:05:42,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:05:42,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:05:42,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648045086] [2024-11-17 00:05:42,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:05:42,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:05:42,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:42,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:05:42,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 00:05:42,482 INFO L87 Difference]: Start difference. First operand 293 states and 377 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:46,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:05:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:47,424 INFO L93 Difference]: Finished difference Result 374 states and 479 transitions. [2024-11-17 00:05:47,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:05:47,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-17 00:05:47,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:47,431 INFO L225 Difference]: With dead ends: 374 [2024-11-17 00:05:47,431 INFO L226 Difference]: Without dead ends: 371 [2024-11-17 00:05:47,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 00:05:47,433 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 91 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:47,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 492 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 1 Unknown, 364 Unchecked, 4.9s Time] [2024-11-17 00:05:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-17 00:05:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 344. [2024-11-17 00:05:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 338 states have (on average 1.2899408284023668) internal successors, (436), 339 states have internal predecessors, (436), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:05:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 442 transitions. [2024-11-17 00:05:47,457 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 442 transitions. Word has length 16 [2024-11-17 00:05:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:47,457 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 442 transitions. [2024-11-17 00:05:47,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 442 transitions. [2024-11-17 00:05:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:05:47,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:47,459 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:47,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 00:05:47,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:47,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:47,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash -506857772, now seen corresponding path program 1 times [2024-11-17 00:05:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:47,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700193246] [2024-11-17 00:05:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:05:47,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:47,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:47,664 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:05:47,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 00:05:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:05:47,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:05:47,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:05:47,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:05:47,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:47,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700193246] [2024-11-17 00:05:47,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700193246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:05:47,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:05:47,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:05:47,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024568053] [2024-11-17 00:05:47,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:05:47,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:05:47,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:47,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:05:47,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:05:47,976 INFO L87 Difference]: Start difference. First operand 344 states and 442 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:52,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:05:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:53,784 INFO L93 Difference]: Finished difference Result 382 states and 487 transitions. [2024-11-17 00:05:53,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:05:53,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-11-17 00:05:53,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:53,793 INFO L225 Difference]: With dead ends: 382 [2024-11-17 00:05:53,793 INFO L226 Difference]: Without dead ends: 377 [2024-11-17 00:05:53,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:05:53,794 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 155 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:53,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 759 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2024-11-17 00:05:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-17 00:05:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 342. [2024-11-17 00:05:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 336 states have (on average 1.2886904761904763) internal successors, (433), 337 states have internal predecessors, (433), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:05:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 439 transitions. [2024-11-17 00:05:53,807 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 439 transitions. Word has length 26 [2024-11-17 00:05:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:53,807 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 439 transitions. [2024-11-17 00:05:53,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 439 transitions. [2024-11-17 00:05:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:05:53,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:53,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:53,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:05:54,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:54,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:54,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:54,013 INFO L85 PathProgramCache]: Analyzing trace with hash -165100491, now seen corresponding path program 1 times [2024-11-17 00:05:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:54,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770517552] [2024-11-17 00:05:54,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:05:54,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:54,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:54,016 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:05:54,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 00:05:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:05:54,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:05:54,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:05:54,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:05:54,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:54,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770517552] [2024-11-17 00:05:54,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770517552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:05:54,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:05:54,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:05:54,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424240481] [2024-11-17 00:05:54,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:05:54,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:05:54,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:54,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:05:54,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:05:54,246 INFO L87 Difference]: Start difference. First operand 342 states and 439 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:54,389 INFO L93 Difference]: Finished difference Result 351 states and 424 transitions. [2024-11-17 00:05:54,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:05:54,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-11-17 00:05:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:54,391 INFO L225 Difference]: With dead ends: 351 [2024-11-17 00:05:54,391 INFO L226 Difference]: Without dead ends: 351 [2024-11-17 00:05:54,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:05:54,392 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 36 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:54,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 663 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:05:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-17 00:05:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-11-17 00:05:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 345 states have (on average 1.2115942028985507) internal successors, (418), 346 states have internal predecessors, (418), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:05:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 424 transitions. [2024-11-17 00:05:54,403 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 424 transitions. Word has length 50 [2024-11-17 00:05:54,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:54,403 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 424 transitions. [2024-11-17 00:05:54,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 424 transitions. [2024-11-17 00:05:54,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:05:54,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:54,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:54,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 00:05:54,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:54,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:54,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:54,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1395250197, now seen corresponding path program 1 times [2024-11-17 00:05:54,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:54,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402520718] [2024-11-17 00:05:54,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:05:54,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:54,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:54,608 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:05:54,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 00:05:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:05:54,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:05:54,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:05:54,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:05:54,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:54,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402520718] [2024-11-17 00:05:54,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402520718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:05:54,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:05:54,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:05:54,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123868482] [2024-11-17 00:05:54,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:05:54,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:05:54,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:54,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:05:54,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:05:54,856 INFO L87 Difference]: Start difference. First operand 351 states and 424 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:54,933 INFO L93 Difference]: Finished difference Result 333 states and 394 transitions. [2024-11-17 00:05:54,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:05:54,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-11-17 00:05:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:54,935 INFO L225 Difference]: With dead ends: 333 [2024-11-17 00:05:54,935 INFO L226 Difference]: Without dead ends: 333 [2024-11-17 00:05:54,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:05:54,937 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 9 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:54,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 664 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:05:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-17 00:05:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2024-11-17 00:05:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 327 states have (on average 1.1865443425076452) internal successors, (388), 328 states have internal predecessors, (388), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:05:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 394 transitions. [2024-11-17 00:05:54,944 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 394 transitions. Word has length 50 [2024-11-17 00:05:54,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:54,945 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 394 transitions. [2024-11-17 00:05:54,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 394 transitions. [2024-11-17 00:05:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:05:54,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:54,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:54,953 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-11-17 00:05:55,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:55,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:55,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:55,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1735730449, now seen corresponding path program 1 times [2024-11-17 00:05:55,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:55,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647168310] [2024-11-17 00:05:55,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:05:55,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:55,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:55,153 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:05:55,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 00:05:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:05:55,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:05:55,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:55,387 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:05:55,387 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:05:55,388 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:05:55,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-17 00:05:55,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:05:55,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 00:05:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:05:55,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:05:55,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:55,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647168310] [2024-11-17 00:05:55,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647168310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:05:55,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:05:55,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:05:55,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367851583] [2024-11-17 00:05:55,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:05:55,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:05:55,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:55,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:05:55,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:05:55,528 INFO L87 Difference]: Start difference. First operand 333 states and 394 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:56,190 INFO L93 Difference]: Finished difference Result 340 states and 412 transitions. [2024-11-17 00:05:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:05:56,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 50 [2024-11-17 00:05:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:56,193 INFO L225 Difference]: With dead ends: 340 [2024-11-17 00:05:56,193 INFO L226 Difference]: Without dead ends: 337 [2024-11-17 00:05:56,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:05:56,194 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 110 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:56,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1006 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:05:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-17 00:05:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 289. [2024-11-17 00:05:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 283 states have (on average 1.2084805653710247) internal successors, (342), 284 states have internal predecessors, (342), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:05:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 348 transitions. [2024-11-17 00:05:56,203 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 348 transitions. Word has length 50 [2024-11-17 00:05:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:56,203 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 348 transitions. [2024-11-17 00:05:56,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:05:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 348 transitions. [2024-11-17 00:05:56,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 00:05:56,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:56,206 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:56,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-17 00:05:56,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:56,407 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:56,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:56,407 INFO L85 PathProgramCache]: Analyzing trace with hash 438056542, now seen corresponding path program 1 times [2024-11-17 00:05:56,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:56,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172405482] [2024-11-17 00:05:56,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:05:56,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:56,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:56,412 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:05:56,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 00:05:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:05:56,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:05:56,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:05:56,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:05:56,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:56,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172405482] [2024-11-17 00:05:56,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172405482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:05:56,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:05:56,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:05:56,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091114400] [2024-11-17 00:05:56,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:05:56,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:05:56,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:56,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:05:56,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:05:56,921 INFO L87 Difference]: Start difference. First operand 289 states and 348 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-17 00:05:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:57,049 INFO L93 Difference]: Finished difference Result 295 states and 338 transitions. [2024-11-17 00:05:57,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:05:57,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 88 [2024-11-17 00:05:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:57,051 INFO L225 Difference]: With dead ends: 295 [2024-11-17 00:05:57,052 INFO L226 Difference]: Without dead ends: 295 [2024-11-17 00:05:57,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:05:57,053 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 30 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:57,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 622 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:05:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-17 00:05:57,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-11-17 00:05:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 289 states have (on average 1.1487889273356402) internal successors, (332), 290 states have internal predecessors, (332), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:05:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 338 transitions. [2024-11-17 00:05:57,061 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 338 transitions. Word has length 88 [2024-11-17 00:05:57,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:57,061 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 338 transitions. [2024-11-17 00:05:57,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-17 00:05:57,061 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 338 transitions. [2024-11-17 00:05:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 00:05:57,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:57,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:57,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-17 00:05:57,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:57,266 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:57,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:57,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1197176092, now seen corresponding path program 1 times [2024-11-17 00:05:57,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:57,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305213921] [2024-11-17 00:05:57,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:05:57,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:57,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:57,269 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:05:57,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 00:05:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:05:57,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:05:57,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:05:57,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:05:57,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:57,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305213921] [2024-11-17 00:05:57,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305213921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:05:57,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:05:57,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:05:57,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954904494] [2024-11-17 00:05:57,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:05:57,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:05:57,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:57,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:05:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:05:57,720 INFO L87 Difference]: Start difference. First operand 295 states and 338 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-11-17 00:05:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:57,770 INFO L93 Difference]: Finished difference Result 298 states and 342 transitions. [2024-11-17 00:05:57,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:05:57,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 88 [2024-11-17 00:05:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:57,774 INFO L225 Difference]: With dead ends: 298 [2024-11-17 00:05:57,774 INFO L226 Difference]: Without dead ends: 298 [2024-11-17 00:05:57,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:05:57,776 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:57,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 686 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:05:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-17 00:05:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-17 00:05:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 291 states have (on average 1.1512027491408934) internal successors, (335), 293 states have internal predecessors, (335), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:05:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 342 transitions. [2024-11-17 00:05:57,784 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 342 transitions. Word has length 88 [2024-11-17 00:05:57,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:57,785 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 342 transitions. [2024-11-17 00:05:57,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-11-17 00:05:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 342 transitions. [2024-11-17 00:05:57,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-17 00:05:57,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:57,786 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:57,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 00:05:57,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:57,987 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:57,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:57,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1608504408, now seen corresponding path program 1 times [2024-11-17 00:05:57,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:57,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129465213] [2024-11-17 00:05:57,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:05:57,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:57,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:57,989 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:05:57,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-17 00:05:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:05:58,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:05:58,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:05:58,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:05:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:05:58,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:58,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129465213] [2024-11-17 00:05:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129465213] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:05:58,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:05:58,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 00:05:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663048563] [2024-11-17 00:05:58,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:05:58,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:05:58,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:58,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:05:58,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:05:58,595 INFO L87 Difference]: Start difference. First operand 298 states and 342 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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-11-17 00:05:58,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:05:58,777 INFO L93 Difference]: Finished difference Result 309 states and 358 transitions. [2024-11-17 00:05:58,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:05:58,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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 90 [2024-11-17 00:05:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:05:58,781 INFO L225 Difference]: With dead ends: 309 [2024-11-17 00:05:58,782 INFO L226 Difference]: Without dead ends: 309 [2024-11-17 00:05:58,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:05:58,782 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 4 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:05:58,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1139 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:05:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-17 00:05:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-11-17 00:05:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 299 states have (on average 1.1672240802675586) internal successors, (349), 301 states have internal predecessors, (349), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:05:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 356 transitions. [2024-11-17 00:05:58,789 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 356 transitions. Word has length 90 [2024-11-17 00:05:58,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:05:58,790 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 356 transitions. [2024-11-17 00:05:58,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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-11-17 00:05:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 356 transitions. [2024-11-17 00:05:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-17 00:05:58,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:05:58,791 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:05:58,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-17 00:05:58,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:58,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:05:58,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:05:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1655991332, now seen corresponding path program 2 times [2024-11-17 00:05:58,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:05:58,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944230988] [2024-11-17 00:05:58,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:05:58,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:05:58,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:05:58,995 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:05:58,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 00:05:59,273 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:05:59,273 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:05:59,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:05:59,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:05:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-17 00:05:59,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:05:59,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:05:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944230988] [2024-11-17 00:05:59,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944230988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:05:59,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:05:59,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:05:59,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402399883] [2024-11-17 00:05:59,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:05:59,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:05:59,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:05:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:05:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:05:59,353 INFO L87 Difference]: Start difference. First operand 307 states and 356 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-17 00:06:03,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:06:07,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:06:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:06:10,308 INFO L93 Difference]: Finished difference Result 443 states and 521 transitions. [2024-11-17 00:06:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:06:10,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 94 [2024-11-17 00:06:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:06:10,313 INFO L225 Difference]: With dead ends: 443 [2024-11-17 00:06:10,313 INFO L226 Difference]: Without dead ends: 443 [2024-11-17 00:06:10,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:06:10,314 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 488 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:06:10,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 401 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 2 Unknown, 0 Unchecked, 10.9s Time] [2024-11-17 00:06:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-17 00:06:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 415. [2024-11-17 00:06:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 406 states have (on average 1.1699507389162562) internal successors, (475), 408 states have internal predecessors, (475), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:06:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 485 transitions. [2024-11-17 00:06:10,324 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 485 transitions. Word has length 94 [2024-11-17 00:06:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:06:10,324 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 485 transitions. [2024-11-17 00:06:10,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-11-17 00:06:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 485 transitions. [2024-11-17 00:06:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-17 00:06:10,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:06:10,326 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:06:10,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-17 00:06:10,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:06:10,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:06:10,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:06:10,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1494647862, now seen corresponding path program 1 times [2024-11-17 00:06:10,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:06:10,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935644540] [2024-11-17 00:06:10,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:06:10,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:06:10,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:06:10,529 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:06:10,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-17 00:06:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:06:11,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:06:11,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:06:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:06:11,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:06:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:06:11,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:06:11,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935644540] [2024-11-17 00:06:11,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935644540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:06:11,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:06:11,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 00:06:11,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134120375] [2024-11-17 00:06:11,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:06:11,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:06:11,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:06:11,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:06:11,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:06:11,378 INFO L87 Difference]: Start difference. First operand 415 states and 485 transitions. Second operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 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-11-17 00:06:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:06:11,955 INFO L93 Difference]: Finished difference Result 430 states and 508 transitions. [2024-11-17 00:06:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:06:11,956 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 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 104 [2024-11-17 00:06:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:06:11,958 INFO L225 Difference]: With dead ends: 430 [2024-11-17 00:06:11,959 INFO L226 Difference]: Without dead ends: 426 [2024-11-17 00:06:11,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:06:11,960 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 7 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:06:11,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1823 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:06:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-17 00:06:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 424. [2024-11-17 00:06:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 415 states have (on average 1.1734939759036145) internal successors, (487), 417 states have internal predecessors, (487), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:06:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 497 transitions. [2024-11-17 00:06:11,976 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 497 transitions. Word has length 104 [2024-11-17 00:06:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:06:11,977 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 497 transitions. [2024-11-17 00:06:11,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 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-11-17 00:06:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 497 transitions. [2024-11-17 00:06:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-17 00:06:11,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:06:11,978 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:06:11,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-17 00:06:12,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:06:12,180 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:06:12,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:06:12,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1915988176, now seen corresponding path program 2 times [2024-11-17 00:06:12,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:06:12,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139779593] [2024-11-17 00:06:12,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:06:12,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:06:12,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:06:12,185 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:06:12,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-17 00:06:12,746 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:06:12,746 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:06:12,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:06:12,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:06:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-17 00:06:12,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:06:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-17 00:06:13,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:06:13,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139779593] [2024-11-17 00:06:13,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139779593] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:06:13,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:06:13,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 00:06:13,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245975437] [2024-11-17 00:06:13,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:06:13,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:06:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:06:13,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:06:13,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:06:13,620 INFO L87 Difference]: Start difference. First operand 424 states and 497 transitions. Second operand has 26 states, 26 states have (on average 4.653846153846154) internal successors, (121), 26 states have internal predecessors, (121), 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-11-17 00:06:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:06:15,593 INFO L93 Difference]: Finished difference Result 448 states and 538 transitions. [2024-11-17 00:06:15,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 00:06:15,597 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.653846153846154) internal successors, (121), 26 states have internal predecessors, (121), 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 113 [2024-11-17 00:06:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:06:15,599 INFO L225 Difference]: With dead ends: 448 [2024-11-17 00:06:15,599 INFO L226 Difference]: Without dead ends: 444 [2024-11-17 00:06:15,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 00:06:15,600 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 13 mSDsluCounter, 2511 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:06:15,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2741 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:06:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-17 00:06:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 442. [2024-11-17 00:06:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 433 states have (on average 1.1801385681293302) internal successors, (511), 435 states have internal predecessors, (511), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:06:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 521 transitions. [2024-11-17 00:06:15,612 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 521 transitions. Word has length 113 [2024-11-17 00:06:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:06:15,612 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 521 transitions. [2024-11-17 00:06:15,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.653846153846154) internal successors, (121), 26 states have internal predecessors, (121), 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-11-17 00:06:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 521 transitions. [2024-11-17 00:06:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-17 00:06:15,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:06:15,614 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:06:15,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-17 00:06:15,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:06:15,815 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:06:15,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:06:15,816 INFO L85 PathProgramCache]: Analyzing trace with hash 225111312, now seen corresponding path program 3 times [2024-11-17 00:06:15,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:06:15,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796557581] [2024-11-17 00:06:15,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:06:15,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:06:15,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:06:15,821 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:06:15,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-17 00:06:16,356 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:06:16,356 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:06:16,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:06:16,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:06:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-17 00:06:16,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:06:16,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:06:16,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796557581] [2024-11-17 00:06:16,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796557581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:06:16,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:06:16,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:06:16,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937677835] [2024-11-17 00:06:16,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:06:16,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:06:16,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:06:16,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:06:16,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:06:16,437 INFO L87 Difference]: Start difference. First operand 442 states and 521 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-11-17 00:06:20,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-11-17 00:06:24,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:06:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:06:26,913 INFO L93 Difference]: Finished difference Result 445 states and 524 transitions. [2024-11-17 00:06:26,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:06:26,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 131 [2024-11-17 00:06:26,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:06:26,917 INFO L225 Difference]: With dead ends: 445 [2024-11-17 00:06:26,917 INFO L226 Difference]: Without dead ends: 445 [2024-11-17 00:06:26,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:06:26,918 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 205 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:06:26,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 415 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2024-11-17 00:06:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-17 00:06:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 443. [2024-11-17 00:06:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 434 states have (on average 1.1797235023041475) internal successors, (512), 436 states have internal predecessors, (512), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:06:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 522 transitions. [2024-11-17 00:06:26,928 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 522 transitions. Word has length 131 [2024-11-17 00:06:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:06:26,929 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 522 transitions. [2024-11-17 00:06:26,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-11-17 00:06:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 522 transitions. [2024-11-17 00:06:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-17 00:06:26,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:06:26,931 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:06:26,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-17 00:06:27,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:06:27,131 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:06:27,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:06:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1112614993, now seen corresponding path program 1 times [2024-11-17 00:06:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:06:27,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649294947] [2024-11-17 00:06:27,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:06:27,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:06:27,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:06:27,134 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:06:27,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-17 00:06:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:06:27,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 00:06:27,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:06:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-17 00:06:28,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:06:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-17 00:06:30,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:06:30,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649294947] [2024-11-17 00:06:30,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649294947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:06:30,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:06:30,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 00:06:30,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332202466] [2024-11-17 00:06:30,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:06:30,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 00:06:30,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:06:30,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 00:06:30,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 00:06:30,334 INFO L87 Difference]: Start difference. First operand 443 states and 522 transitions. Second operand has 50 states, 50 states have (on average 2.9) internal successors, (145), 50 states have internal predecessors, (145), 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-11-17 00:06:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:06:38,268 INFO L93 Difference]: Finished difference Result 483 states and 595 transitions. [2024-11-17 00:06:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 00:06:38,269 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.9) internal successors, (145), 50 states have internal predecessors, (145), 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 131 [2024-11-17 00:06:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:06:38,290 INFO L225 Difference]: With dead ends: 483 [2024-11-17 00:06:38,291 INFO L226 Difference]: Without dead ends: 479 [2024-11-17 00:06:38,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 00:06:38,293 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 25 mSDsluCounter, 5473 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5703 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:06:38,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5703 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-17 00:06:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-17 00:06:38,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2024-11-17 00:06:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 468 states have (on average 1.1923076923076923) internal successors, (558), 470 states have internal predecessors, (558), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:06:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 568 transitions. [2024-11-17 00:06:38,328 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 568 transitions. Word has length 131 [2024-11-17 00:06:38,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:06:38,329 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 568 transitions. [2024-11-17 00:06:38,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.9) internal successors, (145), 50 states have internal predecessors, (145), 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-11-17 00:06:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 568 transitions. [2024-11-17 00:06:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-17 00:06:38,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:06:38,331 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:06:38,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-17 00:06:38,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:06:38,532 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:06:38,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:06:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1423038737, now seen corresponding path program 2 times [2024-11-17 00:06:38,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:06:38,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145738144] [2024-11-17 00:06:38,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:06:38,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:06:38,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:06:38,535 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:06:38,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-17 00:06:39,694 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:06:39,694 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:06:39,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:06:39,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:06:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-11-17 00:06:40,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:06:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-11-17 00:06:42,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:06:42,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145738144] [2024-11-17 00:06:42,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145738144] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:06:42,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:06:42,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-17 00:06:42,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727472789] [2024-11-17 00:06:42,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:06:42,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-17 00:06:42,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:06:42,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-17 00:06:42,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-17 00:06:42,723 INFO L87 Difference]: Start difference. First operand 477 states and 568 transitions. Second operand has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:06:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:06:50,380 INFO L93 Difference]: Finished difference Result 506 states and 624 transitions. [2024-11-17 00:06:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-17 00:06:50,380 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 165 [2024-11-17 00:06:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:06:50,382 INFO L225 Difference]: With dead ends: 506 [2024-11-17 00:06:50,383 INFO L226 Difference]: Without dead ends: 506 [2024-11-17 00:06:50,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-17 00:06:50,385 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 27 mSDsluCounter, 5903 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6132 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:06:50,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6132 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-17 00:06:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-17 00:06:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 502. [2024-11-17 00:06:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 493 states have (on average 1.2332657200811359) internal successors, (608), 495 states have internal predecessors, (608), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:06:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 618 transitions. [2024-11-17 00:06:50,395 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 618 transitions. Word has length 165 [2024-11-17 00:06:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:06:50,395 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 618 transitions. [2024-11-17 00:06:50,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:06:50,395 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 618 transitions. [2024-11-17 00:06:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-17 00:06:50,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:06:50,406 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:06:50,428 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 (17)] Forceful destruction successful, exit code 0 [2024-11-17 00:06:50,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:06:50,607 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:06:50,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:06:50,607 INFO L85 PathProgramCache]: Analyzing trace with hash -305107637, now seen corresponding path program 3 times [2024-11-17 00:06:50,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:06:50,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070294800] [2024-11-17 00:06:50,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:06:50,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:06:50,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:06:50,609 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:06:50,610 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 (18)] Waiting until timeout for monitored process [2024-11-17 00:06:51,196 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:06:51,196 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:06:51,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:06:51,212 INFO L278 TraceCheckSpWp]: Computing forward predicates...