./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/ldv-memsafety/memleaks_test12-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:49:13,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:49:13,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:49:13,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:49:13,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:49:13,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:49:13,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:49:13,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:49:13,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:49:13,303 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:49:13,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:49:13,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:49:13,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:49:13,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:49:13,305 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:49:13,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:49:13,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:49:13,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:49:13,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:49:13,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:49:13,308 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:49:13,309 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:49:13,309 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:49:13,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:49:13,310 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:49:13,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:49:13,310 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:49:13,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:49:13,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:49:13,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:49:13,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:49:13,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:49:13,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:49:13,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:49:13,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:49:13,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:49:13,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:49:13,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:49:13,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:49:13,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:49:13,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:49:13,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:49:13,313 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 [2024-11-09 07:49:13,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:49:13,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:49:13,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:49:13,522 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:49:13,522 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:49:13,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-11-09 07:49:14,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:49:15,065 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:49:15,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-11-09 07:49:15,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0985256cd/feda360b3ffc4a7691a54f430496b70d/FLAG223634c20 [2024-11-09 07:49:15,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0985256cd/feda360b3ffc4a7691a54f430496b70d [2024-11-09 07:49:15,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:49:15,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:49:15,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:49:15,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:49:15,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:49:15,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:15" (1/1) ... [2024-11-09 07:49:15,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e79d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:15, skipping insertion in model container [2024-11-09 07:49:15,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:15" (1/1) ... [2024-11-09 07:49:15,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:49:15,435 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:15,510 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:15,511 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:15,518 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:15,519 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:15,520 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:15,522 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:15,523 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:15,524 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:15,524 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:15,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:49:15,549 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-09 07:49:15,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1d2fd02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:15, skipping insertion in model container [2024-11-09 07:49:15,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:49:15,550 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:49:15,552 INFO L158 Benchmark]: Toolchain (without parser) took 457.05ms. Allocated memory is still 155.2MB. Free memory was 97.4MB in the beginning and 78.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 07:49:15,552 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:49:15,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.06ms. Allocated memory is still 155.2MB. Free memory was 97.1MB in the beginning and 78.6MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 07:49:15,554 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.15ms. Allocated memory is still 155.2MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.06ms. Allocated memory is still 155.2MB. Free memory was 97.1MB in the beginning and 78.6MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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/ldv-memsafety/memleaks_test12-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:49:17,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:49:17,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 07:49:17,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:49:17,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:49:17,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:49:17,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:49:17,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:49:17,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:49:17,391 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:49:17,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:49:17,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:49:17,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:49:17,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:49:17,392 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:49:17,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:49:17,392 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:49:17,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:49:17,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:49:17,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:49:17,396 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:49:17,396 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:49:17,396 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:49:17,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:49:17,397 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:49:17,397 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:49:17,399 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:49:17,399 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:49:17,400 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:49:17,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:49:17,400 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:49:17,400 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:49:17,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:49:17,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:49:17,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:49:17,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:49:17,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:49:17,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:49:17,410 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:49:17,411 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:17,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:49:17,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:49:17,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:49:17,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:49:17,412 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 [2024-11-09 07:49:17,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:49:17,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:49:17,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:49:17,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:49:17,714 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:49:17,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-11-09 07:49:19,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:49:19,274 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:49:19,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-11-09 07:49:19,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0207e28bf/b10c3b42edf04e67b57b193a74416965/FLAG79d4a19b5 [2024-11-09 07:49:19,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0207e28bf/b10c3b42edf04e67b57b193a74416965 [2024-11-09 07:49:19,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:49:19,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:49:19,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:49:19,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:49:19,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:49:19,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:19,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb3a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19, skipping insertion in model container [2024-11-09 07:49:19,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:19,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:49:19,638 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,708 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,709 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,716 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,719 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,721 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,722 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,723 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,724 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,724 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:49:19,749 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:49:19,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:49:19,775 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,794 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,795 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,796 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,797 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,797 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,798 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,798 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,799 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,799 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:19,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:49:19,814 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:49:19,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:49:19,917 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:49:19,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19 WrapperNode [2024-11-09 07:49:19,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:49:19,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:49:19,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:49:19,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:49:19,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:19,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:19,979 INFO L138 Inliner]: procedures = 179, calls = 145, calls flagged for inlining = 33, calls inlined = 20, statements flattened = 349 [2024-11-09 07:49:19,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:49:19,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:49:19,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:49:19,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:49:20,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:20,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:20,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:20,080 INFO L175 MemorySlicer]: Split 55 memory accesses to 2 slices as follows [10, 45]. 82 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [8, 2]. The 23 writes are split as follows [0, 23]. [2024-11-09 07:49:20,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:20,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:20,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:20,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:20,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:20,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:20,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:49:20,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:49:20,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:49:20,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:49:20,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19" (1/1) ... [2024-11-09 07:49:20,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:49:20,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:49:20,161 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-09 07:49:20,164 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-09 07:49:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 07:49:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 07:49:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 07:49:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 07:49:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-11-09 07:49:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-11-09 07:49:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-09 07:49:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-09 07:49:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-11-09 07:49:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-11-09 07:49:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-11-09 07:49:20,205 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-11-09 07:49:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-09 07:49:20,205 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-09 07:49:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-09 07:49:20,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-09 07:49:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 07:49:20,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 07:49:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-09 07:49:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-09 07:49:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 07:49:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 07:49:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:49:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:49:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2024-11-09 07:49:20,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2024-11-09 07:49:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:49:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:49:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:49:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4#0 [2024-11-09 07:49:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4#1 [2024-11-09 07:49:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:49:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:49:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 07:49:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 07:49:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:49:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:49:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:49:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 07:49:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 07:49:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1#0 [2024-11-09 07:49:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1#1 [2024-11-09 07:49:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:49:20,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:49:20,398 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:49:20,400 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:49:20,545 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 07:49:20,652 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 07:49:21,369 INFO L? ?]: Removed 414 outVars from TransFormulas that were not future-live. [2024-11-09 07:49:21,370 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:49:21,392 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:49:21,393 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:49:21,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:49:21 BoogieIcfgContainer [2024-11-09 07:49:21,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:49:21,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:49:21,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:49:21,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:49:21,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:49:19" (1/3) ... [2024-11-09 07:49:21,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ced9391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:49:21, skipping insertion in model container [2024-11-09 07:49:21,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:19" (2/3) ... [2024-11-09 07:49:21,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ced9391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:49:21, skipping insertion in model container [2024-11-09 07:49:21,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:49:21" (3/3) ... [2024-11-09 07:49:21,401 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test12-2.i [2024-11-09 07:49:21,415 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:49:21,415 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 124 error locations. [2024-11-09 07:49:21,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:49:21,465 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;@4b717d71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:49:21,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 124 error locations. [2024-11-09 07:49:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 171 states have (on average 1.8654970760233918) internal successors, (319), 294 states have internal predecessors, (319), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 07:49:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:49:21,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:21,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:21,476 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:49:21,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:21,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1462279470, now seen corresponding path program 1 times [2024-11-09 07:49:21,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:21,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867077689] [2024-11-09 07:49:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:21,498 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-09 07:49:21,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:21,501 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-09 07:49:21,502 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-09 07:49:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:21,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:49:21,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:21,707 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-09 07:49:21,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:21,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:21,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867077689] [2024-11-09 07:49:21,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867077689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:21,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:21,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:49:21,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589369565] [2024-11-09 07:49:21,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:21,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:49:21,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:21,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:49:21,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:49:21,734 INFO L87 Difference]: Start difference. First operand has 313 states, 171 states have (on average 1.8654970760233918) internal successors, (319), 294 states have internal predecessors, (319), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:22,479 INFO L93 Difference]: Finished difference Result 412 states and 459 transitions. [2024-11-09 07:49:22,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:49:22,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 07:49:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:22,497 INFO L225 Difference]: With dead ends: 412 [2024-11-09 07:49:22,497 INFO L226 Difference]: Without dead ends: 408 [2024-11-09 07:49:22,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-09 07:49:22,501 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 299 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:22,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 501 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:49:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-09 07:49:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 344. [2024-11-09 07:49:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 200 states have (on average 1.83) internal successors, (366), 321 states have internal predecessors, (366), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-11-09 07:49:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 402 transitions. [2024-11-09 07:49:22,559 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 402 transitions. Word has length 11 [2024-11-09 07:49:22,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:22,561 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 402 transitions. [2024-11-09 07:49:22,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:22,562 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 402 transitions. [2024-11-09 07:49:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:49:22,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:22,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:22,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:22,765 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-09 07:49:22,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:49:22,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:22,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1462279469, now seen corresponding path program 1 times [2024-11-09 07:49:22,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:22,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419914468] [2024-11-09 07:49:22,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:22,767 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-09 07:49:22,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:22,768 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-09 07:49:22,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 07:49:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:22,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:49:22,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:22,956 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-09 07:49:22,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:22,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:22,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419914468] [2024-11-09 07:49:22,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419914468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:22,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:22,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:49:22,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228271908] [2024-11-09 07:49:22,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:22,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:49:22,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:22,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:49:22,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:49:22,960 INFO L87 Difference]: Start difference. First operand 344 states and 402 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:23,655 INFO L93 Difference]: Finished difference Result 476 states and 564 transitions. [2024-11-09 07:49:23,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:49:23,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 07:49:23,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:23,658 INFO L225 Difference]: With dead ends: 476 [2024-11-09 07:49:23,658 INFO L226 Difference]: Without dead ends: 476 [2024-11-09 07:49:23,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-09 07:49:23,659 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 131 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:23,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 830 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:49:23,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-09 07:49:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 407. [2024-11-09 07:49:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 256 states have (on average 1.83203125) internal successors, (469), 376 states have internal predecessors, (469), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2024-11-09 07:49:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 520 transitions. [2024-11-09 07:49:23,682 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 520 transitions. Word has length 11 [2024-11-09 07:49:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:23,683 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 520 transitions. [2024-11-09 07:49:23,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 520 transitions. [2024-11-09 07:49:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:49:23,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:23,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:23,688 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-09 07:49:23,886 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-09 07:49:23,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:49:23,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1945184146, now seen corresponding path program 1 times [2024-11-09 07:49:23,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:23,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065442698] [2024-11-09 07:49:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:23,889 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-09 07:49:23,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:23,890 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-09 07:49:23,891 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-09 07:49:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:23,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:49:23,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:23,982 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-09 07:49:23,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:23,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:23,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065442698] [2024-11-09 07:49:23,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065442698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:23,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:23,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:49:23,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683288853] [2024-11-09 07:49:23,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:23,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:49:23,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:23,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:49:23,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:23,985 INFO L87 Difference]: Start difference. First operand 407 states and 520 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:24,079 INFO L93 Difference]: Finished difference Result 607 states and 761 transitions. [2024-11-09 07:49:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:49:24,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 07:49:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:24,083 INFO L225 Difference]: With dead ends: 607 [2024-11-09 07:49:24,083 INFO L226 Difference]: Without dead ends: 607 [2024-11-09 07:49:24,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:24,084 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 216 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:24,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1336 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:49:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-09 07:49:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 392. [2024-11-09 07:49:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 241 states have (on average 1.8215767634854771) internal successors, (439), 362 states have internal predecessors, (439), 21 states have call successors, (21), 9 states have call predecessors, (21), 10 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-09 07:49:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 494 transitions. [2024-11-09 07:49:24,102 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 494 transitions. Word has length 11 [2024-11-09 07:49:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:24,105 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 494 transitions. [2024-11-09 07:49:24,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 494 transitions. [2024-11-09 07:49:24,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:49:24,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:24,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:24,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:24,306 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-09 07:49:24,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:49:24,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:24,307 INFO L85 PathProgramCache]: Analyzing trace with hash -796252301, now seen corresponding path program 1 times [2024-11-09 07:49:24,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:24,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840224957] [2024-11-09 07:49:24,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:24,308 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-09 07:49:24,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:24,310 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-09 07:49:24,311 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-09 07:49:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:24,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:49:24,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:24,514 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-09 07:49:24,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:24,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:24,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840224957] [2024-11-09 07:49:24,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840224957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:24,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:24,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:49:24,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785601613] [2024-11-09 07:49:24,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:24,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:49:24,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:24,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:49:24,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:49:24,517 INFO L87 Difference]: Start difference. First operand 392 states and 494 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:25,283 INFO L93 Difference]: Finished difference Result 436 states and 541 transitions. [2024-11-09 07:49:25,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:49:25,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 07:49:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:25,287 INFO L225 Difference]: With dead ends: 436 [2024-11-09 07:49:25,288 INFO L226 Difference]: Without dead ends: 436 [2024-11-09 07:49:25,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:49:25,288 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 56 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:25,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1149 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:49:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-09 07:49:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 404. [2024-11-09 07:49:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 250 states have (on average 1.804) internal successors, (451), 372 states have internal predecessors, (451), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-09 07:49:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 506 transitions. [2024-11-09 07:49:25,305 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 506 transitions. Word has length 13 [2024-11-09 07:49:25,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:25,305 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 506 transitions. [2024-11-09 07:49:25,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:25,305 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 506 transitions. [2024-11-09 07:49:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:49:25,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:25,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:25,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 07:49:25,508 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-09 07:49:25,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:49:25,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:25,509 INFO L85 PathProgramCache]: Analyzing trace with hash -796252300, now seen corresponding path program 1 times [2024-11-09 07:49:25,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:25,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944471103] [2024-11-09 07:49:25,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:25,510 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-09 07:49:25,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:25,511 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-09 07:49:25,512 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-09 07:49:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:25,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:49:25,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:25,777 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-09 07:49:25,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:25,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:25,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944471103] [2024-11-09 07:49:25,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944471103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:25,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:25,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:49:25,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404947719] [2024-11-09 07:49:25,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:25,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:49:25,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:25,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:49:25,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:49:25,779 INFO L87 Difference]: Start difference. First operand 404 states and 506 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:26,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:26,613 INFO L93 Difference]: Finished difference Result 424 states and 522 transitions. [2024-11-09 07:49:26,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:49:26,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 07:49:26,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:26,615 INFO L225 Difference]: With dead ends: 424 [2024-11-09 07:49:26,615 INFO L226 Difference]: Without dead ends: 424 [2024-11-09 07:49:26,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:49:26,616 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 29 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:26,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1294 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 07:49:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-09 07:49:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 413. [2024-11-09 07:49:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 259 states have (on average 1.7915057915057915) internal successors, (464), 381 states have internal predecessors, (464), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-09 07:49:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 519 transitions. [2024-11-09 07:49:26,629 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 519 transitions. Word has length 13 [2024-11-09 07:49:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:26,629 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 519 transitions. [2024-11-09 07:49:26,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 519 transitions. [2024-11-09 07:49:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:49:26,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:26,630 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:26,633 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-09 07:49:26,831 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-09 07:49:26,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:49:26,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:26,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1984077660, now seen corresponding path program 1 times [2024-11-09 07:49:26,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:26,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368963429] [2024-11-09 07:49:26,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:26,832 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-09 07:49:26,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:26,833 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-09 07:49:26,834 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-09 07:49:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:26,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:49:26,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:26,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:26,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:26,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368963429] [2024-11-09 07:49:26,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368963429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:26,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:26,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:49:26,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463630062] [2024-11-09 07:49:26,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:26,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:49:26,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:26,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:49:26,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:26,943 INFO L87 Difference]: Start difference. First operand 413 states and 519 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:49:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:26,989 INFO L93 Difference]: Finished difference Result 347 states and 394 transitions. [2024-11-09 07:49:26,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:49:26,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-09 07:49:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:26,991 INFO L225 Difference]: With dead ends: 347 [2024-11-09 07:49:26,991 INFO L226 Difference]: Without dead ends: 347 [2024-11-09 07:49:26,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:26,992 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 0 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:26,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1348 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:49:26,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-09 07:49:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2024-11-09 07:49:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 199 states have (on average 1.7688442211055277) internal successors, (352), 320 states have internal predecessors, (352), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (19), 17 states have call predecessors, (19), 16 states have call successors, (19) [2024-11-09 07:49:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 387 transitions. [2024-11-09 07:49:27,004 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 387 transitions. Word has length 17 [2024-11-09 07:49:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:27,004 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 387 transitions. [2024-11-09 07:49:27,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:49:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 387 transitions. [2024-11-09 07:49:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:49:27,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:27,005 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:27,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 07:49:27,207 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-09 07:49:27,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:49:27,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2017486629, now seen corresponding path program 1 times [2024-11-09 07:49:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:27,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088018608] [2024-11-09 07:49:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:27,208 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-09 07:49:27,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:27,210 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-09 07:49:27,211 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-09 07:49:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:27,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:49:27,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:49:27,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:27,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:27,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088018608] [2024-11-09 07:49:27,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088018608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:27,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:27,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:49:27,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196393252] [2024-11-09 07:49:27,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:27,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:49:27,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:27,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:49:27,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:27,311 INFO L87 Difference]: Start difference. First operand 345 states and 387 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:49:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:27,348 INFO L93 Difference]: Finished difference Result 349 states and 396 transitions. [2024-11-09 07:49:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:49:27,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-09 07:49:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:27,351 INFO L225 Difference]: With dead ends: 349 [2024-11-09 07:49:27,351 INFO L226 Difference]: Without dead ends: 349 [2024-11-09 07:49:27,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:27,351 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 0 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:27,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1355 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:49:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-09 07:49:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2024-11-09 07:49:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 201 states have (on average 1.7611940298507462) internal successors, (354), 321 states have internal predecessors, (354), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (19), 18 states have call predecessors, (19), 16 states have call successors, (19) [2024-11-09 07:49:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 389 transitions. [2024-11-09 07:49:27,358 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 389 transitions. Word has length 17 [2024-11-09 07:49:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:27,358 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 389 transitions. [2024-11-09 07:49:27,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:49:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 389 transitions. [2024-11-09 07:49:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:49:27,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:27,359 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:27,362 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-09 07:49:27,559 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-09 07:49:27,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:49:27,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:27,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2017486378, now seen corresponding path program 1 times [2024-11-09 07:49:27,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:27,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089615605] [2024-11-09 07:49:27,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:27,561 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-09 07:49:27,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:27,563 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:27,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 07:49:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:27,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:49:27,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:49:27,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:49:27,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:27,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089615605] [2024-11-09 07:49:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089615605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:49:27,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:27,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-11-09 07:49:27,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050578775] [2024-11-09 07:49:27,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:27,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:49:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:27,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:49:27,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:27,681 INFO L87 Difference]: Start difference. First operand 347 states and 389 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:49:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:27,745 INFO L93 Difference]: Finished difference Result 346 states and 388 transitions. [2024-11-09 07:49:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:49:27,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-09 07:49:27,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:27,747 INFO L225 Difference]: With dead ends: 346 [2024-11-09 07:49:27,747 INFO L226 Difference]: Without dead ends: 346 [2024-11-09 07:49:27,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:27,747 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 213 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:27,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1097 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:49:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-09 07:49:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-09 07:49:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 201 states have (on average 1.756218905472637) internal successors, (353), 320 states have internal predecessors, (353), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (19), 18 states have call predecessors, (19), 16 states have call successors, (19) [2024-11-09 07:49:27,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 388 transitions. [2024-11-09 07:49:27,753 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 388 transitions. Word has length 17 [2024-11-09 07:49:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:27,754 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 388 transitions. [2024-11-09 07:49:27,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:49:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 388 transitions. [2024-11-09 07:49:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:49:27,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:27,754 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:27,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:27,955 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-09 07:49:27,955 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:49:27,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:27,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2046115780, now seen corresponding path program 1 times [2024-11-09 07:49:27,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:27,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745494811] [2024-11-09 07:49:27,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:27,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:27,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:27,958 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-09 07:49:27,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 (10)] Waiting until timeout for monitored process [2024-11-09 07:49:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:28,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:49:28,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:28,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-09 07:49:28,135 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 07:49:28,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:49:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:28,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:34,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:34,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745494811] [2024-11-09 07:49:34,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745494811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:49:34,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:34,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-11-09 07:49:34,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575195590] [2024-11-09 07:49:34,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:34,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:49:34,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:34,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:49:34,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:49:34,679 INFO L87 Difference]: Start difference. First operand 346 states and 388 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:49:39,368 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 [0] [2024-11-09 07:49:43,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:49:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:43,861 INFO L93 Difference]: Finished difference Result 380 states and 424 transitions. [2024-11-09 07:49:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:49:43,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2024-11-09 07:49:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:43,865 INFO L225 Difference]: With dead ends: 380 [2024-11-09 07:49:43,865 INFO L226 Difference]: Without dead ends: 380 [2024-11-09 07:49:43,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:49:43,865 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 229 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:43,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 861 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 746 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2024-11-09 07:49:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-09 07:49:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 348. [2024-11-09 07:49:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 205 states have (on average 1.7317073170731707) internal successors, (355), 322 states have internal predecessors, (355), 16 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (20), 18 states have call predecessors, (20), 16 states have call successors, (20) [2024-11-09 07:49:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 391 transitions. [2024-11-09 07:49:43,874 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 391 transitions. Word has length 17 [2024-11-09 07:49:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:43,874 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 391 transitions. [2024-11-09 07:49:43,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:49:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 391 transitions. [2024-11-09 07:49:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:49:43,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:43,874 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:43,877 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-09 07:49:44,075 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-09 07:49:44,075 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:49:44,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:44,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2046115779, now seen corresponding path program 1 times [2024-11-09 07:49:44,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:44,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031477870] [2024-11-09 07:49:44,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:44,076 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-09 07:49:44,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:44,077 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-09 07:49:44,078 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-09 07:49:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:44,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:49:44,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:44,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 07:49:44,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-09 07:49:44,269 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-09 07:49:44,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:44,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:49:44,310 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:49:44,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:49:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:49:44,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:48,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:48,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031477870] [2024-11-09 07:49:48,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031477870] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:48,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1783917351] [2024-11-09 07:49:48,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:48,535 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:48,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:49:48,536 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:49:48,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-09 07:49:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:48,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:49:48,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:48,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 07:49:48,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-09 07:49:48,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:48,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:49:48,755 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:49:48,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:49:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:49:48,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:52,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1783917351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:52,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:52,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-09 07:49:52,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826710438] [2024-11-09 07:49:52,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:52,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:49:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:52,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:49:52,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=69, Unknown=2, NotChecked=16, Total=110 [2024-11-09 07:49:52,898 INFO L87 Difference]: Start difference. First operand 348 states and 391 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:49:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:55,347 INFO L93 Difference]: Finished difference Result 656 states and 767 transitions. [2024-11-09 07:49:55,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:49:55,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-09 07:49:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:55,349 INFO L225 Difference]: With dead ends: 656 [2024-11-09 07:49:55,349 INFO L226 Difference]: Without dead ends: 656 [2024-11-09 07:49:55,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=30, Invalid=104, Unknown=2, NotChecked=20, Total=156 [2024-11-09 07:49:55,350 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 501 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:55,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1514 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1482 Invalid, 0 Unknown, 711 Unchecked, 2.3s Time] [2024-11-09 07:49:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-09 07:49:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 360. [2024-11-09 07:49:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 215 states have (on average 1.716279069767442) internal successors, (369), 331 states have internal predecessors, (369), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (30), 21 states have call predecessors, (30), 18 states have call successors, (30) [2024-11-09 07:49:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 417 transitions. [2024-11-09 07:49:55,361 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 417 transitions. Word has length 17 [2024-11-09 07:49:55,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:55,361 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 417 transitions. [2024-11-09 07:49:55,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:49:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 417 transitions. [2024-11-09 07:49:55,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:49:55,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:55,363 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:55,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 07:49:55,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:55,764 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:55,764 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:49:55,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1882432167, now seen corresponding path program 1 times [2024-11-09 07:49:55,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:55,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327169586] [2024-11-09 07:49:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:55,765 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-09 07:49:55,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:55,766 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-09 07:49:55,767 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-09 07:49:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:55,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:49:55,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:55,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:49:56,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:56,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327169586] [2024-11-09 07:49:56,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327169586] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:49:56,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:56,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-09 07:49:56,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682041933] [2024-11-09 07:49:56,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:56,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:49:56,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:56,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:49:56,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:49:56,037 INFO L87 Difference]: Start difference. First operand 360 states and 417 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:49:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:56,502 INFO L93 Difference]: Finished difference Result 363 states and 418 transitions. [2024-11-09 07:49:56,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:49:56,502 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2024-11-09 07:49:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:56,503 INFO L225 Difference]: With dead ends: 363 [2024-11-09 07:49:56,504 INFO L226 Difference]: Without dead ends: 363 [2024-11-09 07:49:56,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:49:56,504 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 737 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:56,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1255 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:49:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-09 07:49:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2024-11-09 07:49:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 215 states have (on average 1.7069767441860466) internal successors, (367), 330 states have internal predecessors, (367), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (30), 21 states have call predecessors, (30), 18 states have call successors, (30) [2024-11-09 07:49:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 415 transitions. [2024-11-09 07:49:56,517 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 415 transitions. Word has length 18 [2024-11-09 07:49:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:56,518 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 415 transitions. [2024-11-09 07:49:56,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:49:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 415 transitions. [2024-11-09 07:49:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:49:56,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:56,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:56,523 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-09 07:49:56,720 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-09 07:49:56,721 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:49:56,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:56,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1569438937, now seen corresponding path program 1 times [2024-11-09 07:49:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:56,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794364821] [2024-11-09 07:49:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:56,721 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-09 07:49:56,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:56,722 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-09 07:49:56,723 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-09 07:49:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:56,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:49:56,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:56,824 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-09 07:49:56,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:56,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794364821] [2024-11-09 07:49:56,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794364821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:56,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:56,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:49:56,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652947394] [2024-11-09 07:49:56,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:56,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:49:56,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:56,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:49:56,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:49:56,825 INFO L87 Difference]: Start difference. First operand 359 states and 415 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:57,403 INFO L93 Difference]: Finished difference Result 362 states and 417 transitions. [2024-11-09 07:49:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:49:57,403 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-09 07:49:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:57,404 INFO L225 Difference]: With dead ends: 362 [2024-11-09 07:49:57,404 INFO L226 Difference]: Without dead ends: 349 [2024-11-09 07:49:57,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-09 07:49:57,405 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 41 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:57,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 661 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:49:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-09 07:49:57,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-09 07:49:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 206 states have (on average 1.733009708737864) internal successors, (357), 321 states have internal predecessors, (357), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-11-09 07:49:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 404 transitions. [2024-11-09 07:49:57,412 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 404 transitions. Word has length 18 [2024-11-09 07:49:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:57,412 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 404 transitions. [2024-11-09 07:49:57,413 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 404 transitions. [2024-11-09 07:49:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:49:57,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:57,413 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:57,417 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-09 07:49:57,613 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-09 07:49:57,614 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:49:57,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash 149147163, now seen corresponding path program 1 times [2024-11-09 07:49:57,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:57,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701209030] [2024-11-09 07:49:57,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:57,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:57,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:57,616 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-09 07:49:57,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 07:49:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:57,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:49:57,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:57,760 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 07:49:57,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:49:57,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-11-09 07:49:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:49:57,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:57,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701209030] [2024-11-09 07:49:57,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701209030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:57,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1883847468] [2024-11-09 07:49:57,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:57,967 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:57,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:49:57,968 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:49:57,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-09 07:49:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:58,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:49:58,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:58,130 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 07:49:58,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:49:58,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-11-09 07:49:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:49:58,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:58,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1883847468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:58,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:58,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-09 07:49:58,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766186484] [2024-11-09 07:49:58,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:58,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:49:58,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:49:58,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:49:58,279 INFO L87 Difference]: Start difference. First operand 349 states and 404 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:49:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:59,652 INFO L93 Difference]: Finished difference Result 426 states and 479 transitions. [2024-11-09 07:49:59,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:49:59,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-11-09 07:49:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:59,654 INFO L225 Difference]: With dead ends: 426 [2024-11-09 07:49:59,654 INFO L226 Difference]: Without dead ends: 426 [2024-11-09 07:49:59,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:49:59,654 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 264 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:59,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 914 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 07:49:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-09 07:49:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 351. [2024-11-09 07:49:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 208 states have (on average 1.7307692307692308) internal successors, (360), 323 states have internal predecessors, (360), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-11-09 07:49:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 407 transitions. [2024-11-09 07:49:59,663 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 407 transitions. Word has length 21 [2024-11-09 07:49:59,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:59,664 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 407 transitions. [2024-11-09 07:49:59,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:49:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 407 transitions. [2024-11-09 07:49:59,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:49:59,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:59,665 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:59,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:59,868 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-09 07:50:00,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-09 07:50:00,065 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:50:00,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:00,066 INFO L85 PathProgramCache]: Analyzing trace with hash 149147164, now seen corresponding path program 1 times [2024-11-09 07:50:00,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:00,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557248751] [2024-11-09 07:50:00,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:00,066 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-09 07:50:00,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:00,067 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-09 07:50:00,069 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-09 07:50:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:00,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:50:00,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:00,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:50:00,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:50:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:00,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:00,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:00,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557248751] [2024-11-09 07:50:00,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557248751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:00,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1938228781] [2024-11-09 07:50:00,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:00,544 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:50:00,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:50:00,545 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:50:00,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-09 07:50:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:00,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:50:00,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:00,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:50:00,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:50:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:00,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:05,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1938228781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:05,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:05,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-09 07:50:05,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593298253] [2024-11-09 07:50:05,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:05,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:50:05,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:05,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:50:05,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:50:05,039 INFO L87 Difference]: Start difference. First operand 351 states and 407 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-09 07:50:09,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:50:14,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:50:18,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:50:23,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:50:27,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:50:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:27,178 INFO L93 Difference]: Finished difference Result 419 states and 472 transitions. [2024-11-09 07:50:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:50:27,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 21 [2024-11-09 07:50:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:27,179 INFO L225 Difference]: With dead ends: 419 [2024-11-09 07:50:27,179 INFO L226 Difference]: Without dead ends: 419 [2024-11-09 07:50:27,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:50:27,180 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 468 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:27,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 603 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 800 Invalid, 5 Unknown, 0 Unchecked, 22.0s Time] [2024-11-09 07:50:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-09 07:50:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 350. [2024-11-09 07:50:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 208 states have (on average 1.7211538461538463) internal successors, (358), 322 states have internal predecessors, (358), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-11-09 07:50:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 405 transitions. [2024-11-09 07:50:27,186 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 405 transitions. Word has length 21 [2024-11-09 07:50:27,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:27,186 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 405 transitions. [2024-11-09 07:50:27,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-09 07:50:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 405 transitions. [2024-11-09 07:50:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:50:27,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:27,187 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:27,190 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 (17)] Ended with exit code 0 [2024-11-09 07:50:27,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-11-09 07:50:27,588 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 07:50:27,588 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:50:27,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:27,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1596515452, now seen corresponding path program 1 times [2024-11-09 07:50:27,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:27,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121042286] [2024-11-09 07:50:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:27,589 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-09 07:50:27,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:27,590 INFO L229 MonitoredProcess]: Starting monitored process 19 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-09 07:50:27,590 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 (19)] Waiting until timeout for monitored process [2024-11-09 07:50:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:27,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:50:27,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:27,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:50:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:50:27,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:27,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:27,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121042286] [2024-11-09 07:50:27,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121042286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:27,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:27,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:50:27,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118648313] [2024-11-09 07:50:27,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:27,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:50:27,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:27,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:50:27,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:27,704 INFO L87 Difference]: Start difference. First operand 350 states and 405 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-09 07:50:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:28,361 INFO L93 Difference]: Finished difference Result 386 states and 444 transitions. [2024-11-09 07:50:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:50:28,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 23 [2024-11-09 07:50:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:28,362 INFO L225 Difference]: With dead ends: 386 [2024-11-09 07:50:28,362 INFO L226 Difference]: Without dead ends: 386 [2024-11-09 07:50:28,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:50:28,363 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 50 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:28,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1033 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:50:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-09 07:50:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 352. [2024-11-09 07:50:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 210 states have (on average 1.7190476190476192) internal successors, (361), 324 states have internal predecessors, (361), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-11-09 07:50:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 408 transitions. [2024-11-09 07:50:28,368 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 408 transitions. Word has length 23 [2024-11-09 07:50:28,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:28,368 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 408 transitions. [2024-11-09 07:50:28,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-09 07:50:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 408 transitions. [2024-11-09 07:50:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:50:28,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:28,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:28,372 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 (19)] Ended with exit code 0 [2024-11-09 07:50:28,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 07:50:28,570 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:50:28,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1596515453, now seen corresponding path program 1 times [2024-11-09 07:50:28,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:28,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72966347] [2024-11-09 07:50:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:28,570 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-09 07:50:28,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:28,571 INFO L229 MonitoredProcess]: Starting monitored process 20 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-09 07:50:28,573 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 (20)] Waiting until timeout for monitored process [2024-11-09 07:50:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:28,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:50:28,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:28,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:50:28,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:50:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:50:28,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:28,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:28,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72966347] [2024-11-09 07:50:28,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72966347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:28,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:28,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:50:28,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591009814] [2024-11-09 07:50:28,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:28,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:50:28,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:28,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:50:28,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:28,799 INFO L87 Difference]: Start difference. First operand 352 states and 408 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-09 07:50:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:29,430 INFO L93 Difference]: Finished difference Result 375 states and 432 transitions. [2024-11-09 07:50:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:50:29,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 23 [2024-11-09 07:50:29,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:29,432 INFO L225 Difference]: With dead ends: 375 [2024-11-09 07:50:29,432 INFO L226 Difference]: Without dead ends: 375 [2024-11-09 07:50:29,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:50:29,433 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 37 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:29,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1074 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:50:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-09 07:50:29,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 352. [2024-11-09 07:50:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 210 states have (on average 1.7142857142857142) internal successors, (360), 324 states have internal predecessors, (360), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-11-09 07:50:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 407 transitions. [2024-11-09 07:50:29,446 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 407 transitions. Word has length 23 [2024-11-09 07:50:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:29,446 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 407 transitions. [2024-11-09 07:50:29,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-09 07:50:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 407 transitions. [2024-11-09 07:50:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:50:29,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:29,447 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:29,450 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 (20)] Ended with exit code 0 [2024-11-09 07:50:29,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 07:50:29,647 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:50:29,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:29,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1986599339, now seen corresponding path program 1 times [2024-11-09 07:50:29,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:29,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142929553] [2024-11-09 07:50:29,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:29,648 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-09 07:50:29,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:29,649 INFO L229 MonitoredProcess]: Starting monitored process 21 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-09 07:50:29,650 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 (21)] Waiting until timeout for monitored process [2024-11-09 07:50:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:29,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:50:29,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:29,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:29,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:29,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142929553] [2024-11-09 07:50:29,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142929553] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:50:29,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:29,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-11-09 07:50:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018864259] [2024-11-09 07:50:29,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:29,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:50:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:29,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:50:29,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:29,767 INFO L87 Difference]: Start difference. First operand 352 states and 407 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:50:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:29,803 INFO L93 Difference]: Finished difference Result 351 states and 406 transitions. [2024-11-09 07:50:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:50:29,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-11-09 07:50:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:29,805 INFO L225 Difference]: With dead ends: 351 [2024-11-09 07:50:29,805 INFO L226 Difference]: Without dead ends: 351 [2024-11-09 07:50:29,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:29,806 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 201 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:29,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1094 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:50:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-09 07:50:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-11-09 07:50:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 210 states have (on average 1.7095238095238094) internal successors, (359), 323 states have internal predecessors, (359), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-11-09 07:50:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 406 transitions. [2024-11-09 07:50:29,811 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 406 transitions. Word has length 25 [2024-11-09 07:50:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:29,811 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 406 transitions. [2024-11-09 07:50:29,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:50:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 406 transitions. [2024-11-09 07:50:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:50:29,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:29,812 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:29,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 (21)] Forceful destruction successful, exit code 0 [2024-11-09 07:50:30,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 07:50:30,013 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:50:30,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:30,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1986599573, now seen corresponding path program 1 times [2024-11-09 07:50:30,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:30,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491546526] [2024-11-09 07:50:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:30,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-09 07:50:30,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:30,015 INFO L229 MonitoredProcess]: Starting monitored process 22 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-09 07:50:30,016 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 (22)] Waiting until timeout for monitored process [2024-11-09 07:50:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:30,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:50:30,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:30,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:30,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:30,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491546526] [2024-11-09 07:50:30,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491546526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:30,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:30,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:50:30,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657616354] [2024-11-09 07:50:30,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:30,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:50:30,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:30,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:50:30,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:30,122 INFO L87 Difference]: Start difference. First operand 351 states and 406 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:50:30,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:30,156 INFO L93 Difference]: Finished difference Result 349 states and 399 transitions. [2024-11-09 07:50:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:50:30,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-11-09 07:50:30,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:30,158 INFO L225 Difference]: With dead ends: 349 [2024-11-09 07:50:30,158 INFO L226 Difference]: Without dead ends: 349 [2024-11-09 07:50:30,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:30,158 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 0 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:30,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1325 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:50:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-09 07:50:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-09 07:50:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 209 states have (on average 1.6985645933014355) internal successors, (355), 321 states have internal predecessors, (355), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2024-11-09 07:50:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 399 transitions. [2024-11-09 07:50:30,165 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 399 transitions. Word has length 25 [2024-11-09 07:50:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:30,165 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 399 transitions. [2024-11-09 07:50:30,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:50:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 399 transitions. [2024-11-09 07:50:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:50:30,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:30,167 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:30,171 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 (22)] Ended with exit code 0 [2024-11-09 07:50:30,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 07:50:30,369 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:50:30,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:30,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2015228724, now seen corresponding path program 1 times [2024-11-09 07:50:30,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:30,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620761518] [2024-11-09 07:50:30,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:30,369 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-09 07:50:30,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:30,372 INFO L229 MonitoredProcess]: Starting monitored process 23 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-09 07:50:30,373 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 (23)] Waiting until timeout for monitored process [2024-11-09 07:50:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:30,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:50:30,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:30,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-09 07:50:30,488 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-11-09 07:50:30,511 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:50:30,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-09 07:50:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-11-09 07:50:30,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:30,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620761518] [2024-11-09 07:50:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620761518] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:50:30,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:30,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-11-09 07:50:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829524839] [2024-11-09 07:50:30,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:30,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:50:30,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:30,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:50:30,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-09 07:50:30,654 INFO L87 Difference]: Start difference. First operand 349 states and 399 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:50:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:31,851 INFO L93 Difference]: Finished difference Result 375 states and 422 transitions. [2024-11-09 07:50:31,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:50:31,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-11-09 07:50:31,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:31,853 INFO L225 Difference]: With dead ends: 375 [2024-11-09 07:50:31,853 INFO L226 Difference]: Without dead ends: 375 [2024-11-09 07:50:31,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2024-11-09 07:50:31,854 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 178 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 382 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:31,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1003 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 815 Invalid, 0 Unknown, 382 Unchecked, 1.2s Time] [2024-11-09 07:50:31,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-09 07:50:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 351. [2024-11-09 07:50:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 212 states have (on average 1.6886792452830188) internal successors, (358), 323 states have internal predecessors, (358), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2024-11-09 07:50:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 402 transitions. [2024-11-09 07:50:31,862 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 402 transitions. Word has length 25 [2024-11-09 07:50:31,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:31,863 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 402 transitions. [2024-11-09 07:50:31,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:50:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 402 transitions. [2024-11-09 07:50:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:50:31,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:31,863 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:31,871 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 (23)] Ended with exit code 0 [2024-11-09 07:50:32,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 07:50:32,064 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:50:32,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:32,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2015228723, now seen corresponding path program 1 times [2024-11-09 07:50:32,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:32,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444114498] [2024-11-09 07:50:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:32,065 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-09 07:50:32,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:32,067 INFO L229 MonitoredProcess]: Starting monitored process 24 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-09 07:50:32,068 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 (24)] Waiting until timeout for monitored process [2024-11-09 07:50:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:32,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:50:32,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:32,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 07:50:32,278 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-11-09 07:50:32,299 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:50:32,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:50:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-09 07:50:32,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:32,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:32,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444114498] [2024-11-09 07:50:32,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444114498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:32,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [177979869] [2024-11-09 07:50:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:32,495 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:50:32,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:50:32,497 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:50:32,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-09 07:50:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:32,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:50:32,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:32,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 07:50:32,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-09 07:50:32,774 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-09 07:50:32,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:50:32,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:50:32,799 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:50:32,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:50:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-09 07:50:32,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:32,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [177979869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:32,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:32,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-09 07:50:32,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339223306] [2024-11-09 07:50:32,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:32,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:50:32,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:32,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:50:32,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2024-11-09 07:50:32,956 INFO L87 Difference]: Start difference. First operand 351 states and 402 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:50:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:35,645 INFO L93 Difference]: Finished difference Result 629 states and 735 transitions. [2024-11-09 07:50:35,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:50:35,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2024-11-09 07:50:35,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:35,647 INFO L225 Difference]: With dead ends: 629 [2024-11-09 07:50:35,647 INFO L226 Difference]: Without dead ends: 629 [2024-11-09 07:50:35,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=225, Unknown=2, NotChecked=62, Total=342 [2024-11-09 07:50:35,648 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 393 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 3245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1352 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:35,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 2053 Invalid, 3245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1840 Invalid, 0 Unknown, 1352 Unchecked, 2.6s Time] [2024-11-09 07:50:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-09 07:50:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 350. [2024-11-09 07:50:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 212 states have (on average 1.6839622641509433) internal successors, (357), 322 states have internal predecessors, (357), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2024-11-09 07:50:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 401 transitions. [2024-11-09 07:50:35,654 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 401 transitions. Word has length 25 [2024-11-09 07:50:35,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:35,654 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 401 transitions. [2024-11-09 07:50:35,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:50:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 401 transitions. [2024-11-09 07:50:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:50:35,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:35,654 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:35,659 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 (24)] Ended with exit code 0 [2024-11-09 07:50:35,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2024-11-09 07:50:36,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 07:50:36,059 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:50:36,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:36,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1455036927, now seen corresponding path program 1 times [2024-11-09 07:50:36,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:36,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102779933] [2024-11-09 07:50:36,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:36,060 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-09 07:50:36,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:36,061 INFO L229 MonitoredProcess]: Starting monitored process 26 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-09 07:50:36,061 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 (26)] Waiting until timeout for monitored process [2024-11-09 07:50:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:36,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:50:36,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:50:36,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:36,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102779933] [2024-11-09 07:50:36,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102779933] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:50:36,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:36,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-09 07:50:36,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248539773] [2024-11-09 07:50:36,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:36,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:50:36,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:36,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:50:36,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:50:36,482 INFO L87 Difference]: Start difference. First operand 350 states and 401 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:50:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:37,168 INFO L93 Difference]: Finished difference Result 349 states and 399 transitions. [2024-11-09 07:50:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:50:37,169 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2024-11-09 07:50:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:37,170 INFO L225 Difference]: With dead ends: 349 [2024-11-09 07:50:37,170 INFO L226 Difference]: Without dead ends: 349 [2024-11-09 07:50:37,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:50:37,170 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 781 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:37,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1478 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:50:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-09 07:50:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-09 07:50:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 212 states have (on average 1.6745283018867925) internal successors, (355), 321 states have internal predecessors, (355), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2024-11-09 07:50:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 399 transitions. [2024-11-09 07:50:37,175 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 399 transitions. Word has length 26 [2024-11-09 07:50:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:37,175 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 399 transitions. [2024-11-09 07:50:37,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:50:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 399 transitions. [2024-11-09 07:50:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:50:37,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:37,176 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:37,179 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 (26)] Ended with exit code 0 [2024-11-09 07:50:37,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 07:50:37,377 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:50:37,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash -675610894, now seen corresponding path program 1 times [2024-11-09 07:50:37,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:37,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944788783] [2024-11-09 07:50:37,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:37,377 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-09 07:50:37,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:37,379 INFO L229 MonitoredProcess]: Starting monitored process 27 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-09 07:50:37,380 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 (27)] Waiting until timeout for monitored process [2024-11-09 07:50:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:37,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:50:37,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:50:37,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:37,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:37,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944788783] [2024-11-09 07:50:37,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944788783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:37,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:37,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:50:37,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758681352] [2024-11-09 07:50:37,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:37,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:50:37,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:37,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:50:37,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:37,643 INFO L87 Difference]: Start difference. First operand 349 states and 399 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-09 07:50:37,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:37,934 INFO L93 Difference]: Finished difference Result 355 states and 404 transitions. [2024-11-09 07:50:37,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:50:37,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 26 [2024-11-09 07:50:37,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:37,936 INFO L225 Difference]: With dead ends: 355 [2024-11-09 07:50:37,936 INFO L226 Difference]: Without dead ends: 355 [2024-11-09 07:50:37,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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-09 07:50:37,937 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 9 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:37,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1238 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:50:37,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-09 07:50:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2024-11-09 07:50:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 214 states have (on average 1.6682242990654206) internal successors, (357), 323 states have internal predecessors, (357), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2024-11-09 07:50:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 401 transitions. [2024-11-09 07:50:37,944 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 401 transitions. Word has length 26 [2024-11-09 07:50:37,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:37,944 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 401 transitions. [2024-11-09 07:50:37,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-09 07:50:37,944 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 401 transitions. [2024-11-09 07:50:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:50:37,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:37,945 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 07:50:37,951 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 (27)] Ended with exit code 0 [2024-11-09 07:50:38,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 07:50:38,145 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:50:38,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:38,146 INFO L85 PathProgramCache]: Analyzing trace with hash -722027152, now seen corresponding path program 1 times [2024-11-09 07:50:38,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:38,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810265623] [2024-11-09 07:50:38,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:38,146 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-09 07:50:38,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:38,147 INFO L229 MonitoredProcess]: Starting monitored process 28 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-09 07:50:38,148 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 (28)] Waiting until timeout for monitored process [2024-11-09 07:50:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:38,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:50:38,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:38,313 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~client~0#1.base_29| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~client~0#1.base_29|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~client~0#1.base_29| (_ bv0 1))))) is different from true [2024-11-09 07:50:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:38,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:38,406 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-09 07:50:38,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-11-09 07:50:38,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:38,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810265623] [2024-11-09 07:50:38,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810265623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [315401879] [2024-11-09 07:50:38,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:38,547 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:50:38,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:50:38,549 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:50:38,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-09 07:50:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:38,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:50:38,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:38,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:38,891 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-09 07:50:38,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-11-09 07:50:38,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [315401879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:38,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:38,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-09 07:50:38,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827700545] [2024-11-09 07:50:38,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:38,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:50:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:38,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:50:38,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2024-11-09 07:50:38,981 INFO L87 Difference]: Start difference. First operand 351 states and 401 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:50:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:41,124 INFO L93 Difference]: Finished difference Result 363 states and 412 transitions. [2024-11-09 07:50:41,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:50:41,124 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2024-11-09 07:50:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:41,125 INFO L225 Difference]: With dead ends: 363 [2024-11-09 07:50:41,125 INFO L226 Difference]: Without dead ends: 347 [2024-11-09 07:50:41,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 81 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2024-11-09 07:50:41,126 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 347 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 348 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:41,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1360 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1243 Invalid, 0 Unknown, 348 Unchecked, 2.0s Time] [2024-11-09 07:50:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-09 07:50:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2024-11-09 07:50:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 209 states have (on average 1.6794258373205742) internal successors, (351), 319 states have internal predecessors, (351), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2024-11-09 07:50:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 394 transitions. [2024-11-09 07:50:41,130 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 394 transitions. Word has length 28 [2024-11-09 07:50:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:41,131 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 394 transitions. [2024-11-09 07:50:41,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:50:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 394 transitions. [2024-11-09 07:50:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:50:41,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:41,132 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:41,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-09 07:50:41,335 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 (28)] Forceful destruction successful, exit code 0 [2024-11-09 07:50:41,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 07:50:41,532 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:50:41,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:41,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2075336849, now seen corresponding path program 1 times [2024-11-09 07:50:41,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:41,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777025225] [2024-11-09 07:50:41,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:41,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-09 07:50:41,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:41,535 INFO L229 MonitoredProcess]: Starting monitored process 30 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-09 07:50:41,536 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 (30)] Waiting until timeout for monitored process [2024-11-09 07:50:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:41,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:50:41,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:41,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:41,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:41,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777025225] [2024-11-09 07:50:41,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777025225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:41,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:41,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:50:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114070177] [2024-11-09 07:50:41,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:41,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:50:41,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:41,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:50:41,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:41,621 INFO L87 Difference]: Start difference. First operand 345 states and 394 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:50:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:41,657 INFO L93 Difference]: Finished difference Result 336 states and 384 transitions. [2024-11-09 07:50:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:50:41,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-09 07:50:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:41,663 INFO L225 Difference]: With dead ends: 336 [2024-11-09 07:50:41,663 INFO L226 Difference]: Without dead ends: 336 [2024-11-09 07:50:41,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:41,664 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 206 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:41,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1097 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:50:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-09 07:50:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2024-11-09 07:50:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 200 states have (on average 1.705) internal successors, (341), 310 states have internal predecessors, (341), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2024-11-09 07:50:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 384 transitions. [2024-11-09 07:50:41,672 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 384 transitions. Word has length 28 [2024-11-09 07:50:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:41,672 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 384 transitions. [2024-11-09 07:50:41,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:50:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 384 transitions. [2024-11-09 07:50:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:50:41,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:41,673 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:41,680 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 (30)] Ended with exit code 0 [2024-11-09 07:50:41,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 07:50:41,874 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:50:41,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:41,874 INFO L85 PathProgramCache]: Analyzing trace with hash 683652966, now seen corresponding path program 1 times [2024-11-09 07:50:41,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:41,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790250689] [2024-11-09 07:50:41,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:41,875 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-09 07:50:41,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:41,877 INFO L229 MonitoredProcess]: Starting monitored process 31 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-09 07:50:41,878 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 (31)] Waiting until timeout for monitored process [2024-11-09 07:50:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:41,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:50:41,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:41,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-09 07:50:42,025 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 07:50:42,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:50:42,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-11-09 07:50:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:42,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:42,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790250689] [2024-11-09 07:50:42,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790250689] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:50:42,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:42,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-11-09 07:50:42,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342570888] [2024-11-09 07:50:42,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:42,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:50:42,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:42,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:50:42,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:50:42,304 INFO L87 Difference]: Start difference. First operand 336 states and 384 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:50:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:44,085 INFO L93 Difference]: Finished difference Result 363 states and 407 transitions. [2024-11-09 07:50:44,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:50:44,086 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2024-11-09 07:50:44,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:44,087 INFO L225 Difference]: With dead ends: 363 [2024-11-09 07:50:44,087 INFO L226 Difference]: Without dead ends: 363 [2024-11-09 07:50:44,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:50:44,088 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 429 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:44,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1373 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 07:50:44,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-09 07:50:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 339. [2024-11-09 07:50:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 203 states have (on average 1.6945812807881773) internal successors, (344), 313 states have internal predecessors, (344), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2024-11-09 07:50:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 387 transitions. [2024-11-09 07:50:44,092 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 387 transitions. Word has length 30 [2024-11-09 07:50:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:44,092 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 387 transitions. [2024-11-09 07:50:44,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:50:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 387 transitions. [2024-11-09 07:50:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:50:44,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:44,093 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:44,100 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 (31)] Ended with exit code 0 [2024-11-09 07:50:44,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 07:50:44,293 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-09 07:50:44,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:44,294 INFO L85 PathProgramCache]: Analyzing trace with hash -139481591, now seen corresponding path program 1 times [2024-11-09 07:50:44,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:44,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208516569] [2024-11-09 07:50:44,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:44,294 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-09 07:50:44,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:44,297 INFO L229 MonitoredProcess]: Starting monitored process 32 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-09 07:50:44,298 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 (32)] Waiting until timeout for monitored process [2024-11-09 07:50:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:44,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 07:50:44,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:44,458 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 07:50:44,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:50:44,534 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 07:50:44,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:50:44,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-11-09 07:50:44,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-11-09 07:50:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:44,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:44,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:44,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208516569] [2024-11-09 07:50:44,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208516569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:44,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1762922230] [2024-11-09 07:50:44,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:44,814 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:50:44,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:50:44,815 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:50:44,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-09 07:50:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:44,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 07:50:44,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:44,998 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 07:50:44,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:50:45,099 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 07:50:45,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:50:45,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2024-11-09 07:50:45,432 INFO L349 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2024-11-09 07:50:45,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 32 [2024-11-09 07:50:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:45,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:45,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1762922230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:45,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:45,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 13 [2024-11-09 07:50:45,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360431082] [2024-11-09 07:50:45,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:45,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:50:45,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:45,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:50:45,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:50:45,696 INFO L87 Difference]: Start difference. First operand 339 states and 387 transitions. Second operand has 15 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:50:49,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]