./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-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 d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 20:56:55,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 20:56:55,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 20:56:55,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 20:56:55,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 20:56:55,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 20:56:55,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 20:56:55,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 20:56:55,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 20:56:55,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 20:56:55,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 20:56:55,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 20:56:55,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 20:56:55,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 20:56:55,225 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 20:56:55,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 20:56:55,227 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 20:56:55,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 20:56:55,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 20:56:55,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 20:56:55,228 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 20:56:55,228 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 20:56:55,229 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 20:56:55,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 20:56:55,229 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 20:56:55,229 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 20:56:55,229 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 20:56:55,230 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 20:56:55,230 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 20:56:55,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 20:56:55,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 20:56:55,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 20:56:55,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 20:56:55,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:56:55,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 20:56:55,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 20:56:55,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 20:56:55,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 20:56:55,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 20:56:55,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 20:56:55,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 20:56:55,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 20:56:55,233 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 -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2024-11-22 20:56:55,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 20:56:55,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 20:56:55,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 20:56:55,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 20:56:55,431 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 20:56:55,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-11-22 20:56:56,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 20:56:56,933 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 20:56:56,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-11-22 20:56:56,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b50752f7/eb3816597b8a44958a7d2ebac7463556/FLAGdf4b321bb [2024-11-22 20:56:56,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b50752f7/eb3816597b8a44958a7d2ebac7463556 [2024-11-22 20:56:56,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 20:56:56,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 20:56:56,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 20:56:56,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 20:56:56,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 20:56:56,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:56:56" (1/1) ... [2024-11-22 20:56:56,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3ba4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:56, skipping insertion in model container [2024-11-22 20:56:56,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:56:56" (1/1) ... [2024-11-22 20:56:57,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 20:56:57,433 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,454 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,456 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,458 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,462 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,496 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,497 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,499 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,499 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,501 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,502 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,503 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,503 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,506 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,507 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,508 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,509 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,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-22 20:56:57,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-22 20:56:57,512 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:57,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:56:57,531 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-22 20:56:57,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@483e0eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:57, skipping insertion in model container [2024-11-22 20:56:57,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 20:56:57,532 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 20:56:57,534 INFO L158 Benchmark]: Toolchain (without parser) took 557.37ms. Allocated memory is still 169.9MB. Free memory was 97.7MB in the beginning and 125.1MB in the end (delta: -27.4MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-22 20:56:57,535 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 169.9MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 20:56:57,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.38ms. Allocated memory is still 169.9MB. Free memory was 97.5MB in the beginning and 125.1MB in the end (delta: -27.6MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-22 20:56:57,536 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 169.9MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 554.38ms. Allocated memory is still 169.9MB. Free memory was 97.5MB in the beginning and 125.1MB in the end (delta: -27.6MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-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 d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 20:56:59,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 20:56:59,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 20:56:59,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 20:56:59,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 20:56:59,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 20:56:59,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 20:56:59,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 20:56:59,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 20:56:59,218 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 20:56:59,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 20:56:59,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 20:56:59,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 20:56:59,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 20:56:59,221 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 20:56:59,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 20:56:59,221 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 20:56:59,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 20:56:59,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 20:56:59,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 20:56:59,222 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 20:56:59,225 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 20:56:59,226 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 20:56:59,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 20:56:59,226 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 20:56:59,226 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 20:56:59,226 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 20:56:59,226 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 20:56:59,226 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 20:56:59,227 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 20:56:59,227 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 20:56:59,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 20:56:59,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 20:56:59,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 20:56:59,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 20:56:59,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:56:59,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 20:56:59,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 20:56:59,237 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 20:56:59,237 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 20:56:59,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 20:56:59,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 20:56:59,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 20:56:59,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 20:56:59,239 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 -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2024-11-22 20:56:59,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 20:56:59,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 20:56:59,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 20:56:59,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 20:56:59,521 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 20:56:59,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-11-22 20:57:00,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 20:57:01,105 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 20:57:01,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-11-22 20:57:01,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02cc2cb92/942d339be22440af860b2f2bccc49a74/FLAGc077e9795 [2024-11-22 20:57:01,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02cc2cb92/942d339be22440af860b2f2bccc49a74 [2024-11-22 20:57:01,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 20:57:01,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 20:57:01,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 20:57:01,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 20:57:01,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 20:57:01,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:01,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cafedc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01, skipping insertion in model container [2024-11-22 20:57:01,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:01,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 20:57:01,597 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,629 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,641 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,645 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,656 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,684 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,685 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,687 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,687 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,690 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,694 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,694 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,697 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,700 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,704 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,705 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,710 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,710 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,711 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,715 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:57:01,730 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 20:57:01,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 20:57:01,771 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,779 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,781 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,783 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,786 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,806 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,806 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,808 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,810 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,812 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,813 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,814 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,815 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,817 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,818 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,820 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,820 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,821 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,821 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,826 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:57:01,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:57:01,836 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 20:57:01,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:57:01,998 INFO L204 MainTranslator]: Completed translation [2024-11-22 20:57:01,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01 WrapperNode [2024-11-22 20:57:01,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 20:57:02,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 20:57:02,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 20:57:02,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 20:57:02,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:02,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:02,087 INFO L138 Inliner]: procedures = 286, calls = 353, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1243 [2024-11-22 20:57:02,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 20:57:02,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 20:57:02,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 20:57:02,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 20:57:02,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:02,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:02,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:02,196 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 270, 34]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 57, 4]. [2024-11-22 20:57:02,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:02,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:02,238 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:02,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:02,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:02,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:02,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 20:57:02,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 20:57:02,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 20:57:02,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 20:57:02,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01" (1/1) ... [2024-11-22 20:57:02,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:57:02,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:57:02,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 20:57:02,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 20:57:02,350 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-22 20:57:02,351 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-22 20:57:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 20:57:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 20:57:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 20:57:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 20:57:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 20:57:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 20:57:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 20:57:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-22 20:57:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 20:57:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 20:57:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 20:57:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 20:57:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-22 20:57:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-22 20:57:02,353 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 20:57:02,353 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 20:57:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-22 20:57:02,354 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-22 20:57:02,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 20:57:02,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 20:57:02,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 20:57:02,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-22 20:57:02,354 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-22 20:57:02,354 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-22 20:57:02,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 20:57:02,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 20:57:02,559 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 20:57:02,560 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 20:57:05,493 INFO L? ?]: Removed 1307 outVars from TransFormulas that were not future-live. [2024-11-22 20:57:05,493 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 20:57:05,525 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 20:57:05,528 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-22 20:57:05,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:57:05 BoogieIcfgContainer [2024-11-22 20:57:05,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 20:57:05,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 20:57:05,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 20:57:05,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 20:57:05,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:57:01" (1/3) ... [2024-11-22 20:57:05,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6d6f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:57:05, skipping insertion in model container [2024-11-22 20:57:05,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:01" (2/3) ... [2024-11-22 20:57:05,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6d6f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:57:05, skipping insertion in model container [2024-11-22 20:57:05,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:57:05" (3/3) ... [2024-11-22 20:57:05,535 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-2.i [2024-11-22 20:57:05,549 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 20:57:05,549 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 625 error locations. [2024-11-22 20:57:05,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 20:57:05,617 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;@568e77ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 20:57:05,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 625 error locations. [2024-11-22 20:57:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 1284 states, 634 states have (on average 2.2145110410094637) internal successors, (1404), 1262 states have internal predecessors, (1404), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 20:57:05,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 20:57:05,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:05,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 20:57:05,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:05,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash 85465, now seen corresponding path program 1 times [2024-11-22 20:57:05,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307255248] [2024-11-22 20:57:05,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:05,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:05,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:05,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:05,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 20:57:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:05,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:57:05,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:05,826 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-22 20:57:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:05,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:05,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:05,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307255248] [2024-11-22 20:57:05,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307255248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:05,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:05,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:57:05,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063208591] [2024-11-22 20:57:05,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:05,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:57:05,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:05,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:57:05,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:05,888 INFO L87 Difference]: Start difference. First operand has 1284 states, 634 states have (on average 2.2145110410094637) internal successors, (1404), 1262 states have internal predecessors, (1404), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:07,390 INFO L93 Difference]: Finished difference Result 1544 states and 1637 transitions. [2024-11-22 20:57:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:57:07,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-22 20:57:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:07,409 INFO L225 Difference]: With dead ends: 1544 [2024-11-22 20:57:07,409 INFO L226 Difference]: Without dead ends: 1542 [2024-11-22 20:57:07,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:07,413 INFO L432 NwaCegarLoop]: 911 mSDtfsCounter, 914 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:07,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1260 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-22 20:57:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-22 20:57:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1305. [2024-11-22 20:57:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 670 states have (on average 2.0791044776119403) internal successors, (1393), 1285 states have internal predecessors, (1393), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 20:57:07,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1427 transitions. [2024-11-22 20:57:07,518 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1427 transitions. Word has length 3 [2024-11-22 20:57:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:07,524 INFO L471 AbstractCegarLoop]: Abstraction has 1305 states and 1427 transitions. [2024-11-22 20:57:07,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1427 transitions. [2024-11-22 20:57:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 20:57:07,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:07,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 20:57:07,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 20:57:07,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:07,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:07,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:07,726 INFO L85 PathProgramCache]: Analyzing trace with hash 85466, now seen corresponding path program 1 times [2024-11-22 20:57:07,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:07,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419859704] [2024-11-22 20:57:07,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:07,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:07,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:07,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:07,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 20:57:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:07,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:57:07,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:07,837 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-22 20:57:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:07,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:07,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:07,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419859704] [2024-11-22 20:57:07,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419859704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:07,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:07,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:57:07,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973716004] [2024-11-22 20:57:07,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:07,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:57:07,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:57:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:07,847 INFO L87 Difference]: Start difference. First operand 1305 states and 1427 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:09,992 INFO L93 Difference]: Finished difference Result 1908 states and 2080 transitions. [2024-11-22 20:57:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:57:09,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-22 20:57:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:09,997 INFO L225 Difference]: With dead ends: 1908 [2024-11-22 20:57:09,998 INFO L226 Difference]: Without dead ends: 1908 [2024-11-22 20:57:09,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:09,998 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 636 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:09,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1760 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-22 20:57:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2024-11-22 20:57:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1518. [2024-11-22 20:57:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 882 states have (on average 2.061224489795918) internal successors, (1818), 1496 states have internal predecessors, (1818), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 20:57:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1856 transitions. [2024-11-22 20:57:10,021 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1856 transitions. Word has length 3 [2024-11-22 20:57:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:10,022 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1856 transitions. [2024-11-22 20:57:10,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1856 transitions. [2024-11-22 20:57:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 20:57:10,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:10,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:10,026 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-22 20:57:10,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:10,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:10,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1307350193, now seen corresponding path program 1 times [2024-11-22 20:57:10,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:10,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325384399] [2024-11-22 20:57:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:10,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:10,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:10,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:10,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 20:57:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:10,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 20:57:10,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:10,388 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-22 20:57:10,393 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-22 20:57:10,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 20:57:10,440 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-22 20:57:10,453 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 20:57:10,454 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-22 20:57:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:10,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:10,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:10,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325384399] [2024-11-22 20:57:10,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325384399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:10,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:10,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:57:10,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898839329] [2024-11-22 20:57:10,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:10,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:57:10,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:10,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:57:10,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:10,475 INFO L87 Difference]: Start difference. First operand 1518 states and 1856 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:13,843 INFO L93 Difference]: Finished difference Result 2603 states and 3022 transitions. [2024-11-22 20:57:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:57:13,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 20:57:13,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:13,851 INFO L225 Difference]: With dead ends: 2603 [2024-11-22 20:57:13,851 INFO L226 Difference]: Without dead ends: 2603 [2024-11-22 20:57:13,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:13,854 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 1129 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:13,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1813 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-22 20:57:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2024-11-22 20:57:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1667. [2024-11-22 20:57:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1031 states have (on average 2.0417070805043647) internal successors, (2105), 1645 states have internal predecessors, (2105), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 20:57:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2143 transitions. [2024-11-22 20:57:13,883 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2143 transitions. Word has length 8 [2024-11-22 20:57:13,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:13,883 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2143 transitions. [2024-11-22 20:57:13,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2143 transitions. [2024-11-22 20:57:13,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 20:57:13,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:13,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:13,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 20:57:14,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:14,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:14,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150296, now seen corresponding path program 1 times [2024-11-22 20:57:14,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:14,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126015960] [2024-11-22 20:57:14,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:14,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:14,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:14,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:14,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 20:57:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:14,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:57:14,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:14,213 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-22 20:57:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:14,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:14,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:14,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126015960] [2024-11-22 20:57:14,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126015960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:14,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:14,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:57:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629814060] [2024-11-22 20:57:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:14,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:57:14,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:14,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:57:14,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:14,232 INFO L87 Difference]: Start difference. First operand 1667 states and 2143 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:16,039 INFO L93 Difference]: Finished difference Result 2214 states and 2918 transitions. [2024-11-22 20:57:16,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:57:16,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-22 20:57:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:16,045 INFO L225 Difference]: With dead ends: 2214 [2024-11-22 20:57:16,045 INFO L226 Difference]: Without dead ends: 2214 [2024-11-22 20:57:16,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:16,047 INFO L432 NwaCegarLoop]: 1227 mSDtfsCounter, 924 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 2518 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:16,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 2518 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 20:57:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2024-11-22 20:57:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1622. [2024-11-22 20:57:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1031 states have (on average 1.9844810863239573) internal successors, (2046), 1600 states have internal predecessors, (2046), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 20:57:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2084 transitions. [2024-11-22 20:57:16,075 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2084 transitions. Word has length 9 [2024-11-22 20:57:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:16,075 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2084 transitions. [2024-11-22 20:57:16,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2084 transitions. [2024-11-22 20:57:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 20:57:16,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:16,077 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:16,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 20:57:16,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:16,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:16,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:16,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150295, now seen corresponding path program 1 times [2024-11-22 20:57:16,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:16,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215253506] [2024-11-22 20:57:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:16,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:16,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:16,282 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:16,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 20:57:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:16,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 20:57:16,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:16,396 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-22 20:57:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:16,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:16,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:16,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215253506] [2024-11-22 20:57:16,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215253506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:16,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:16,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:57:16,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651921049] [2024-11-22 20:57:16,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:16,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:57:16,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:16,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:57:16,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:16,430 INFO L87 Difference]: Start difference. First operand 1622 states and 2084 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:18,700 INFO L93 Difference]: Finished difference Result 2278 states and 2940 transitions. [2024-11-22 20:57:18,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:57:18,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-22 20:57:18,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:18,709 INFO L225 Difference]: With dead ends: 2278 [2024-11-22 20:57:18,709 INFO L226 Difference]: Without dead ends: 2278 [2024-11-22 20:57:18,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:18,710 INFO L432 NwaCegarLoop]: 1403 mSDtfsCounter, 704 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:18,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2873 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-22 20:57:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2024-11-22 20:57:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1614. [2024-11-22 20:57:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1033 states have (on average 1.9593417231364956) internal successors, (2024), 1592 states have internal predecessors, (2024), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 20:57:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2062 transitions. [2024-11-22 20:57:18,734 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2062 transitions. Word has length 9 [2024-11-22 20:57:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:18,734 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2062 transitions. [2024-11-22 20:57:18,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2062 transitions. [2024-11-22 20:57:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 20:57:18,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:18,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:18,738 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-22 20:57:18,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:18,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:18,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:18,936 INFO L85 PathProgramCache]: Analyzing trace with hash -325292811, now seen corresponding path program 1 times [2024-11-22 20:57:18,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:18,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56536144] [2024-11-22 20:57:18,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:18,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:18,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:18,940 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:18,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 20:57:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:19,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 20:57:19,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:19,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:19,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:19,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56536144] [2024-11-22 20:57:19,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56536144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:19,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:19,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:57:19,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110527881] [2024-11-22 20:57:19,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:19,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:57:19,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:19,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:57:19,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:19,109 INFO L87 Difference]: Start difference. First operand 1614 states and 2062 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:19,600 INFO L93 Difference]: Finished difference Result 2240 states and 2833 transitions. [2024-11-22 20:57:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:57:19,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-22 20:57:19,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:19,606 INFO L225 Difference]: With dead ends: 2240 [2024-11-22 20:57:19,606 INFO L226 Difference]: Without dead ends: 2240 [2024-11-22 20:57:19,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:19,607 INFO L432 NwaCegarLoop]: 1454 mSDtfsCounter, 640 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 3950 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:19,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 3950 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 20:57:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2024-11-22 20:57:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1877. [2024-11-22 20:57:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1293 states have (on average 1.9651972157772621) internal successors, (2541), 1852 states have internal predecessors, (2541), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 20:57:19,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2585 transitions. [2024-11-22 20:57:19,633 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2585 transitions. Word has length 13 [2024-11-22 20:57:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:19,633 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2585 transitions. [2024-11-22 20:57:19,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:19,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2585 transitions. [2024-11-22 20:57:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 20:57:19,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:19,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:19,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 20:57:19,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:19,835 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:19,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:19,835 INFO L85 PathProgramCache]: Analyzing trace with hash -922136276, now seen corresponding path program 1 times [2024-11-22 20:57:19,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:19,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887034567] [2024-11-22 20:57:19,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:19,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:19,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:19,837 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:19,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 20:57:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:19,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 20:57:19,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:19,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:19,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:19,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887034567] [2024-11-22 20:57:19,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887034567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:19,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:19,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:57:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689764980] [2024-11-22 20:57:19,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:19,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:57:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:57:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:19,955 INFO L87 Difference]: Start difference. First operand 1877 states and 2585 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:19,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:19,975 INFO L93 Difference]: Finished difference Result 1781 states and 2413 transitions. [2024-11-22 20:57:19,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:57:19,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-22 20:57:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:19,979 INFO L225 Difference]: With dead ends: 1781 [2024-11-22 20:57:19,979 INFO L226 Difference]: Without dead ends: 1781 [2024-11-22 20:57:19,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:19,980 INFO L432 NwaCegarLoop]: 1229 mSDtfsCounter, 71 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:19,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2395 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:57:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2024-11-22 20:57:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1781. [2024-11-22 20:57:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1221 states have (on average 1.9402129402129402) internal successors, (2369), 1756 states have internal predecessors, (2369), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 20:57:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2413 transitions. [2024-11-22 20:57:20,006 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2413 transitions. Word has length 13 [2024-11-22 20:57:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:20,006 INFO L471 AbstractCegarLoop]: Abstraction has 1781 states and 2413 transitions. [2024-11-22 20:57:20,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:20,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2413 transitions. [2024-11-22 20:57:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 20:57:20,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:20,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:20,012 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 (8)] Forceful destruction successful, exit code 0 [2024-11-22 20:57:20,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:20,208 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:20,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1177229704, now seen corresponding path program 1 times [2024-11-22 20:57:20,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:20,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460086782] [2024-11-22 20:57:20,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:20,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:20,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:20,210 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:20,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 (9)] Waiting until timeout for monitored process [2024-11-22 20:57:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:20,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 20:57:20,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:20,363 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 20:57:20,363 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 20:57:20,363 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 20:57:20,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-22 20:57:20,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 20:57:20,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-22 20:57:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:20,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:20,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:20,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460086782] [2024-11-22 20:57:20,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460086782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:20,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:20,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:57:20,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541613454] [2024-11-22 20:57:20,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:20,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:57:20,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:20,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:57:20,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:20,414 INFO L87 Difference]: Start difference. First operand 1781 states and 2413 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:20,654 INFO L93 Difference]: Finished difference Result 2505 states and 2939 transitions. [2024-11-22 20:57:20,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:57:20,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-22 20:57:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:20,661 INFO L225 Difference]: With dead ends: 2505 [2024-11-22 20:57:20,661 INFO L226 Difference]: Without dead ends: 2505 [2024-11-22 20:57:20,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:20,661 INFO L432 NwaCegarLoop]: 1453 mSDtfsCounter, 1107 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 4096 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:20,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 4096 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 20:57:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-22 20:57:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1446. [2024-11-22 20:57:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 888 states have (on average 1.9324324324324325) internal successors, (1716), 1423 states have internal predecessors, (1716), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 20:57:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1756 transitions. [2024-11-22 20:57:20,681 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1756 transitions. Word has length 16 [2024-11-22 20:57:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:20,681 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 1756 transitions. [2024-11-22 20:57:20,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1756 transitions. [2024-11-22 20:57:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 20:57:20,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:20,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:20,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 (9)] Ended with exit code 0 [2024-11-22 20:57:20,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:20,883 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:20,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:20,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1057218028, now seen corresponding path program 1 times [2024-11-22 20:57:20,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:20,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157350986] [2024-11-22 20:57:20,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:20,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:20,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:20,887 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:20,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 20:57:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:21,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 20:57:21,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:21,040 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:21,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:21,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157350986] [2024-11-22 20:57:21,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157350986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:21,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:21,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:57:21,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569076019] [2024-11-22 20:57:21,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:21,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:57:21,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:21,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:57:21,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:21,041 INFO L87 Difference]: Start difference. First operand 1446 states and 1756 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:21,060 INFO L93 Difference]: Finished difference Result 1386 states and 1670 transitions. [2024-11-22 20:57:21,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:57:21,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 20:57:21,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:21,068 INFO L225 Difference]: With dead ends: 1386 [2024-11-22 20:57:21,068 INFO L226 Difference]: Without dead ends: 1386 [2024-11-22 20:57:21,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:21,069 INFO L432 NwaCegarLoop]: 1186 mSDtfsCounter, 71 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:21,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2309 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:57:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-22 20:57:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1386. [2024-11-22 20:57:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 852 states have (on average 1.9131455399061033) internal successors, (1630), 1363 states have internal predecessors, (1630), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 20:57:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1670 transitions. [2024-11-22 20:57:21,083 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1670 transitions. Word has length 19 [2024-11-22 20:57:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:21,083 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1670 transitions. [2024-11-22 20:57:21,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1670 transitions. [2024-11-22 20:57:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 20:57:21,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:21,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:21,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-22 20:57:21,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:21,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:21,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1920722190, now seen corresponding path program 1 times [2024-11-22 20:57:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713404464] [2024-11-22 20:57:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:21,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:21,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:21,287 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:21,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 20:57:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:21,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:57:21,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:21,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:21,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:21,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713404464] [2024-11-22 20:57:21,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713404464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:21,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:21,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:57:21,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678690181] [2024-11-22 20:57:21,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:21,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:57:21,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:21,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:57:21,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:21,453 INFO L87 Difference]: Start difference. First operand 1386 states and 1670 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:21,495 INFO L93 Difference]: Finished difference Result 1356 states and 1612 transitions. [2024-11-22 20:57:21,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:57:21,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-22 20:57:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:21,498 INFO L225 Difference]: With dead ends: 1356 [2024-11-22 20:57:21,498 INFO L226 Difference]: Without dead ends: 1356 [2024-11-22 20:57:21,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:21,499 INFO L432 NwaCegarLoop]: 1141 mSDtfsCounter, 48 mSDsluCounter, 2256 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3397 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:21,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3397 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:57:21,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2024-11-22 20:57:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2024-11-22 20:57:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 836 states have (on average 1.8803827751196172) internal successors, (1572), 1333 states have internal predecessors, (1572), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 20:57:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1612 transitions. [2024-11-22 20:57:21,533 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1612 transitions. Word has length 21 [2024-11-22 20:57:21,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:21,533 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1612 transitions. [2024-11-22 20:57:21,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1612 transitions. [2024-11-22 20:57:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 20:57:21,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:21,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:21,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-22 20:57:21,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:21,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:21,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash -956254243, now seen corresponding path program 1 times [2024-11-22 20:57:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:21,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589462032] [2024-11-22 20:57:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:21,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:21,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:21,740 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:21,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 20:57:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:21,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 20:57:21,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:21,920 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-22 20:57:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:22,082 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:22,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:22,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589462032] [2024-11-22 20:57:22,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589462032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:22,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:22,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:57:22,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835814675] [2024-11-22 20:57:22,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:22,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 20:57:22,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:22,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 20:57:22,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:22,084 INFO L87 Difference]: Start difference. First operand 1356 states and 1612 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:24,592 INFO L93 Difference]: Finished difference Result 1909 states and 2292 transitions. [2024-11-22 20:57:24,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 20:57:24,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-22 20:57:24,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:24,597 INFO L225 Difference]: With dead ends: 1909 [2024-11-22 20:57:24,597 INFO L226 Difference]: Without dead ends: 1909 [2024-11-22 20:57:24,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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-22 20:57:24,598 INFO L432 NwaCegarLoop]: 1387 mSDtfsCounter, 594 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 3658 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:24,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 3658 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-22 20:57:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2024-11-22 20:57:24,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1352. [2024-11-22 20:57:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 836 states have (on average 1.8708133971291867) internal successors, (1564), 1329 states have internal predecessors, (1564), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 20:57:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1604 transitions. [2024-11-22 20:57:24,612 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1604 transitions. Word has length 35 [2024-11-22 20:57:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:24,612 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1604 transitions. [2024-11-22 20:57:24,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1604 transitions. [2024-11-22 20:57:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 20:57:24,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:24,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:24,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-22 20:57:24,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:24,814 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:24,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:24,814 INFO L85 PathProgramCache]: Analyzing trace with hash -956254244, now seen corresponding path program 1 times [2024-11-22 20:57:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:24,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736151701] [2024-11-22 20:57:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:24,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:24,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:24,818 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:24,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-22 20:57:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:24,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 20:57:24,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:24,986 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-22 20:57:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:25,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:25,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:25,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736151701] [2024-11-22 20:57:25,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736151701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:25,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:25,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:57:25,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504838600] [2024-11-22 20:57:25,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:25,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 20:57:25,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:25,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 20:57:25,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:25,049 INFO L87 Difference]: Start difference. First operand 1352 states and 1604 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:26,773 INFO L93 Difference]: Finished difference Result 1778 states and 2151 transitions. [2024-11-22 20:57:26,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 20:57:26,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-22 20:57:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:26,778 INFO L225 Difference]: With dead ends: 1778 [2024-11-22 20:57:26,778 INFO L226 Difference]: Without dead ends: 1778 [2024-11-22 20:57:26,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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-22 20:57:26,779 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 810 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:26,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 2287 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-22 20:57:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2024-11-22 20:57:26,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1348. [2024-11-22 20:57:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 836 states have (on average 1.861244019138756) internal successors, (1556), 1325 states have internal predecessors, (1556), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 20:57:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1596 transitions. [2024-11-22 20:57:26,792 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1596 transitions. Word has length 35 [2024-11-22 20:57:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:26,793 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1596 transitions. [2024-11-22 20:57:26,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1596 transitions. [2024-11-22 20:57:26,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-22 20:57:26,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:26,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:26,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-22 20:57:26,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:26,995 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:26,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash 103975123, now seen corresponding path program 1 times [2024-11-22 20:57:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:26,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064335417] [2024-11-22 20:57:26,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:26,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:26,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:26,997 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:26,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-22 20:57:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:27,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:57:27,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:27,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:27,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:27,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064335417] [2024-11-22 20:57:27,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064335417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:27,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:27,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:57:27,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31818771] [2024-11-22 20:57:27,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:27,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:57:27,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:27,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:57:27,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:27,216 INFO L87 Difference]: Start difference. First operand 1348 states and 1596 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:27,262 INFO L93 Difference]: Finished difference Result 1336 states and 1576 transitions. [2024-11-22 20:57:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:57:27,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-22 20:57:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:27,265 INFO L225 Difference]: With dead ends: 1336 [2024-11-22 20:57:27,265 INFO L226 Difference]: Without dead ends: 1336 [2024-11-22 20:57:27,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:27,266 INFO L432 NwaCegarLoop]: 1135 mSDtfsCounter, 21 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3374 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:27,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3374 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:57:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-11-22 20:57:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2024-11-22 20:57:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 824 states have (on average 1.8640776699029127) internal successors, (1536), 1313 states have internal predecessors, (1536), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 20:57:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1576 transitions. [2024-11-22 20:57:27,277 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1576 transitions. Word has length 55 [2024-11-22 20:57:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:27,277 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1576 transitions. [2024-11-22 20:57:27,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1576 transitions. [2024-11-22 20:57:27,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 20:57:27,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:27,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:27,285 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 (14)] Forceful destruction successful, exit code 0 [2024-11-22 20:57:27,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:27,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:27,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash -635878753, now seen corresponding path program 1 times [2024-11-22 20:57:27,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:27,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340234624] [2024-11-22 20:57:27,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:27,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:27,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:27,481 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:27,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-22 20:57:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:27,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 20:57:27,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:27,835 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-22 20:57:27,836 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 16 treesize of output 17 [2024-11-22 20:57:27,880 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-22 20:57:27,880 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 18 treesize of output 28 [2024-11-22 20:57:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:28,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:28,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:28,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340234624] [2024-11-22 20:57:28,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340234624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:28,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:28,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:57:28,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970305553] [2024-11-22 20:57:28,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:28,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 20:57:28,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:28,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 20:57:28,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-22 20:57:28,188 INFO L87 Difference]: Start difference. First operand 1336 states and 1576 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:30,786 INFO L93 Difference]: Finished difference Result 2445 states and 2881 transitions. [2024-11-22 20:57:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:57:30,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-22 20:57:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:30,791 INFO L225 Difference]: With dead ends: 2445 [2024-11-22 20:57:30,791 INFO L226 Difference]: Without dead ends: 2445 [2024-11-22 20:57:30,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-22 20:57:30,791 INFO L432 NwaCegarLoop]: 893 mSDtfsCounter, 1945 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1945 SdHoareTripleChecker+Valid, 2706 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:30,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1945 Valid, 2706 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-22 20:57:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2024-11-22 20:57:30,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 1785. [2024-11-22 20:57:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1257 states have (on average 1.847255369928401) internal successors, (2322), 1749 states have internal predecessors, (2322), 35 states have call successors, (35), 9 states have call predecessors, (35), 7 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 20:57:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2388 transitions. [2024-11-22 20:57:30,810 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2388 transitions. Word has length 63 [2024-11-22 20:57:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:30,811 INFO L471 AbstractCegarLoop]: Abstraction has 1785 states and 2388 transitions. [2024-11-22 20:57:30,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2388 transitions. [2024-11-22 20:57:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 20:57:30,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:30,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:30,821 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-22 20:57:31,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:31,012 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:31,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash -635878752, now seen corresponding path program 1 times [2024-11-22 20:57:31,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:31,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997027141] [2024-11-22 20:57:31,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:31,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:31,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:31,014 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:31,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-22 20:57:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:31,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 20:57:31,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:31,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 20:57:31,370 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-22 20:57:31,435 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-22 20:57:31,436 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-22 20:57:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:31,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:31,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:31,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997027141] [2024-11-22 20:57:31,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997027141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:31,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:31,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:57:31,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28561537] [2024-11-22 20:57:31,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:31,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 20:57:31,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:31,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 20:57:31,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 20:57:31,886 INFO L87 Difference]: Start difference. First operand 1785 states and 2388 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:33,566 INFO L93 Difference]: Finished difference Result 1790 states and 2394 transitions. [2024-11-22 20:57:33,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:57:33,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-22 20:57:33,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:33,570 INFO L225 Difference]: With dead ends: 1790 [2024-11-22 20:57:33,570 INFO L226 Difference]: Without dead ends: 1790 [2024-11-22 20:57:33,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-22 20:57:33,571 INFO L432 NwaCegarLoop]: 1130 mSDtfsCounter, 58 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:33,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2383 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-22 20:57:33,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2024-11-22 20:57:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1790. [2024-11-22 20:57:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1261 states have (on average 1.84456780333069) internal successors, (2326), 1753 states have internal predecessors, (2326), 36 states have call successors, (36), 10 states have call predecessors, (36), 7 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-22 20:57:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2394 transitions. [2024-11-22 20:57:33,587 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2394 transitions. Word has length 63 [2024-11-22 20:57:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:33,587 INFO L471 AbstractCegarLoop]: Abstraction has 1790 states and 2394 transitions. [2024-11-22 20:57:33,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2394 transitions. [2024-11-22 20:57:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 20:57:33,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:33,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:33,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-22 20:57:33,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:33,789 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:33,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:33,789 INFO L85 PathProgramCache]: Analyzing trace with hash 735482981, now seen corresponding path program 1 times [2024-11-22 20:57:33,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:33,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754098717] [2024-11-22 20:57:33,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:33,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:33,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:33,791 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-22 20:57:33,792 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-22 20:57:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:34,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 20:57:34,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:34,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:34,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:34,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754098717] [2024-11-22 20:57:34,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754098717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:34,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:34,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 20:57:34,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396961007] [2024-11-22 20:57:34,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:34,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 20:57:34,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:34,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 20:57:34,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 20:57:34,050 INFO L87 Difference]: Start difference. First operand 1790 states and 2394 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:34,117 INFO L93 Difference]: Finished difference Result 1816 states and 2421 transitions. [2024-11-22 20:57:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 20:57:34,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-22 20:57:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:34,124 INFO L225 Difference]: With dead ends: 1816 [2024-11-22 20:57:34,125 INFO L226 Difference]: Without dead ends: 1816 [2024-11-22 20:57:34,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 20:57:34,129 INFO L432 NwaCegarLoop]: 1145 mSDtfsCounter, 15 mSDsluCounter, 4575 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5720 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:34,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5720 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:57:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2024-11-22 20:57:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1814. [2024-11-22 20:57:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1279 states have (on average 1.836591086786552) internal successors, (2349), 1773 states have internal predecessors, (2349), 38 states have call successors, (38), 14 states have call predecessors, (38), 11 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-22 20:57:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2421 transitions. [2024-11-22 20:57:34,158 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2421 transitions. Word has length 71 [2024-11-22 20:57:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:34,159 INFO L471 AbstractCegarLoop]: Abstraction has 1814 states and 2421 transitions. [2024-11-22 20:57:34,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2421 transitions. [2024-11-22 20:57:34,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 20:57:34,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:34,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:34,176 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-22 20:57:34,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:34,360 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:34,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:34,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1006494928, now seen corresponding path program 1 times [2024-11-22 20:57:34,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:34,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475068826] [2024-11-22 20:57:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:34,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:34,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:34,362 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:34,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-22 20:57:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:34,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 20:57:34,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:34,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:34,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475068826] [2024-11-22 20:57:34,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475068826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:34,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:34,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 20:57:34,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215268923] [2024-11-22 20:57:34,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:34,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 20:57:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:34,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 20:57:34,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 20:57:34,686 INFO L87 Difference]: Start difference. First operand 1814 states and 2421 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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-22 20:57:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:34,844 INFO L93 Difference]: Finished difference Result 1826 states and 2435 transitions. [2024-11-22 20:57:34,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 20:57:34,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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 69 [2024-11-22 20:57:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:34,847 INFO L225 Difference]: With dead ends: 1826 [2024-11-22 20:57:34,849 INFO L226 Difference]: Without dead ends: 1826 [2024-11-22 20:57:34,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 20:57:34,850 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 22 mSDsluCounter, 4416 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 5545 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:34,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 5545 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 20:57:34,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2024-11-22 20:57:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1817. [2024-11-22 20:57:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1281 states have (on average 1.8352849336455894) internal successors, (2351), 1775 states have internal predecessors, (2351), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-22 20:57:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2424 transitions. [2024-11-22 20:57:34,876 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2424 transitions. Word has length 69 [2024-11-22 20:57:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:34,876 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2424 transitions. [2024-11-22 20:57:34,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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-22 20:57:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2424 transitions. [2024-11-22 20:57:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-22 20:57:34,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:34,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:34,886 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 (18)] Ended with exit code 0 [2024-11-22 20:57:35,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:35,078 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:35,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1237454463, now seen corresponding path program 1 times [2024-11-22 20:57:35,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:35,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140920271] [2024-11-22 20:57:35,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:35,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:35,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:35,082 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-22 20:57:35,083 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-22 20:57:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:35,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 20:57:35,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:35,480 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-22 20:57:35,570 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-22 20:57:35,584 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-22 20:57:35,585 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-22 20:57:35,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:35,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:35,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:35,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140920271] [2024-11-22 20:57:35,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140920271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:35,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:35,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 20:57:35,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778952652] [2024-11-22 20:57:35,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:35,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 20:57:35,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:35,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 20:57:35,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-22 20:57:35,595 INFO L87 Difference]: Start difference. First operand 1817 states and 2424 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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-22 20:57:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:37,705 INFO L93 Difference]: Finished difference Result 2238 states and 2969 transitions. [2024-11-22 20:57:37,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 20:57:37,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 74 [2024-11-22 20:57:37,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:37,709 INFO L225 Difference]: With dead ends: 2238 [2024-11-22 20:57:37,709 INFO L226 Difference]: Without dead ends: 2238 [2024-11-22 20:57:37,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-11-22 20:57:37,709 INFO L432 NwaCegarLoop]: 710 mSDtfsCounter, 771 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 3483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1538 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:37,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2184 Invalid, 3483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1922 Invalid, 0 Unknown, 1538 Unchecked, 2.1s Time] [2024-11-22 20:57:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2024-11-22 20:57:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 1816. [2024-11-22 20:57:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1281 states have (on average 1.8337236533957846) internal successors, (2349), 1774 states have internal predecessors, (2349), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-22 20:57:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2422 transitions. [2024-11-22 20:57:37,727 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2422 transitions. Word has length 74 [2024-11-22 20:57:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:37,727 INFO L471 AbstractCegarLoop]: Abstraction has 1816 states and 2422 transitions. [2024-11-22 20:57:37,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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-22 20:57:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2422 transitions. [2024-11-22 20:57:37,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-22 20:57:37,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:37,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:37,737 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 (19)] Forceful destruction successful, exit code 0 [2024-11-22 20:57:37,928 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-22 20:57:37,929 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:37,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1237454464, now seen corresponding path program 1 times [2024-11-22 20:57:37,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:37,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048505170] [2024-11-22 20:57:37,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:37,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:37,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:37,931 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-22 20:57:37,932 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-22 20:57:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:38,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 20:57:38,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:38,337 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-22 20:57:38,341 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-22 20:57:38,663 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2024-11-22 20:57:38,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 20:57:38,677 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-22 20:57:38,687 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 20:57:38,687 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-22 20:57:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:38,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:38,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:38,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048505170] [2024-11-22 20:57:38,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048505170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:38,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:38,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 20:57:38,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147886235] [2024-11-22 20:57:38,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:38,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 20:57:38,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:38,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 20:57:38,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-22 20:57:38,699 INFO L87 Difference]: Start difference. First operand 1816 states and 2422 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-22 20:57:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:42,175 INFO L93 Difference]: Finished difference Result 2914 states and 3878 transitions. [2024-11-22 20:57:42,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 20:57:42,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 74 [2024-11-22 20:57:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:42,179 INFO L225 Difference]: With dead ends: 2914 [2024-11-22 20:57:42,179 INFO L226 Difference]: Without dead ends: 2914 [2024-11-22 20:57:42,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-22 20:57:42,180 INFO L432 NwaCegarLoop]: 1207 mSDtfsCounter, 1477 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 3379 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 2841 SdHoareTripleChecker+Invalid, 5429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2022 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:42,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 2841 Invalid, 5429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3379 Invalid, 0 Unknown, 2022 Unchecked, 3.4s Time] [2024-11-22 20:57:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2024-11-22 20:57:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1808. [2024-11-22 20:57:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1281 states have (on average 1.8212334113973458) internal successors, (2333), 1766 states have internal predecessors, (2333), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-22 20:57:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2406 transitions. [2024-11-22 20:57:42,197 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2406 transitions. Word has length 74 [2024-11-22 20:57:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:42,197 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2406 transitions. [2024-11-22 20:57:42,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-22 20:57:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2406 transitions. [2024-11-22 20:57:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-22 20:57:42,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:42,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:42,208 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-22 20:57:42,398 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-22 20:57:42,399 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:42,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:42,399 INFO L85 PathProgramCache]: Analyzing trace with hash -948585261, now seen corresponding path program 1 times [2024-11-22 20:57:42,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:42,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749228448] [2024-11-22 20:57:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:42,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:42,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:42,401 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-22 20:57:42,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-22 20:57:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:42,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 20:57:42,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:42,669 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-22 20:57:42,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 20:57:42,716 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 23 treesize of output 11 [2024-11-22 20:57:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:42,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:42,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:42,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749228448] [2024-11-22 20:57:42,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749228448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:42,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:42,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 20:57:42,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412603695] [2024-11-22 20:57:42,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:42,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 20:57:42,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:42,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 20:57:42,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 20:57:42,737 INFO L87 Difference]: Start difference. First operand 1808 states and 2406 transitions. Second operand has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 20:57:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:45,282 INFO L93 Difference]: Finished difference Result 1823 states and 2422 transitions. [2024-11-22 20:57:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 20:57:45,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-11-22 20:57:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:45,285 INFO L225 Difference]: With dead ends: 1823 [2024-11-22 20:57:45,285 INFO L226 Difference]: Without dead ends: 1823 [2024-11-22 20:57:45,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-22 20:57:45,285 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 16 mSDsluCounter, 3731 mSDsCounter, 0 mSdLazyCounter, 3116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4863 SdHoareTripleChecker+Invalid, 3118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:45,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4863 Invalid, 3118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3116 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-22 20:57:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2024-11-22 20:57:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1822. [2024-11-22 20:57:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1293 states have (on average 1.8167053364269141) internal successors, (2349), 1778 states have internal predecessors, (2349), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-22 20:57:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2422 transitions. [2024-11-22 20:57:45,301 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2422 transitions. Word has length 81 [2024-11-22 20:57:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:45,302 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2422 transitions. [2024-11-22 20:57:45,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 20:57:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2422 transitions. [2024-11-22 20:57:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-22 20:57:45,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:45,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:45,311 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 (21)] Ended with exit code 0 [2024-11-22 20:57:45,503 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-22 20:57:45,503 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:45,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:45,504 INFO L85 PathProgramCache]: Analyzing trace with hash 658628057, now seen corresponding path program 1 times [2024-11-22 20:57:45,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:45,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709089809] [2024-11-22 20:57:45,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:45,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:45,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:45,507 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-22 20:57:45,508 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-22 20:57:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:45,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 20:57:45,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:45,803 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-22 20:57:45,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 20:57:45,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 20:57:45,860 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 21 treesize of output 9 [2024-11-22 20:57:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:45,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:45,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:45,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709089809] [2024-11-22 20:57:45,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709089809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:45,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:45,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 20:57:45,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956960656] [2024-11-22 20:57:45,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:45,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 20:57:45,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:45,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 20:57:45,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 20:57:45,910 INFO L87 Difference]: Start difference. First operand 1822 states and 2422 transitions. Second operand has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 20:57:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:49,187 INFO L93 Difference]: Finished difference Result 1822 states and 2420 transitions. [2024-11-22 20:57:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 20:57:49,187 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2024-11-22 20:57:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:49,189 INFO L225 Difference]: With dead ends: 1822 [2024-11-22 20:57:49,189 INFO L226 Difference]: Without dead ends: 1822 [2024-11-22 20:57:49,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 20:57:49,190 INFO L432 NwaCegarLoop]: 1128 mSDtfsCounter, 13 mSDsluCounter, 4710 mSDsCounter, 0 mSdLazyCounter, 3279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5838 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:49,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5838 Invalid, 3280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3279 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-22 20:57:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2024-11-22 20:57:49,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2024-11-22 20:57:49,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1293 states have (on average 1.8151585460170148) internal successors, (2347), 1778 states have internal predecessors, (2347), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-22 20:57:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2420 transitions. [2024-11-22 20:57:49,203 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2420 transitions. Word has length 82 [2024-11-22 20:57:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:49,203 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2420 transitions. [2024-11-22 20:57:49,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 20:57:49,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2420 transitions. [2024-11-22 20:57:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 20:57:49,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:49,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:49,215 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-22 20:57:49,404 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-22 20:57:49,405 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:49,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:49,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1486914519, now seen corresponding path program 1 times [2024-11-22 20:57:49,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:49,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863268466] [2024-11-22 20:57:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:49,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:49,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:49,407 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-22 20:57:49,408 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-22 20:57:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:49,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 20:57:49,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:49,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:49,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:49,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863268466] [2024-11-22 20:57:49,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863268466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:49,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:49,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 20:57:49,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791576055] [2024-11-22 20:57:49,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:49,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 20:57:49,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:49,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 20:57:49,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:49,708 INFO L87 Difference]: Start difference. First operand 1822 states and 2420 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-22 20:57:49,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:49,755 INFO L93 Difference]: Finished difference Result 1838 states and 2438 transitions. [2024-11-22 20:57:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:57:49,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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 89 [2024-11-22 20:57:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:49,758 INFO L225 Difference]: With dead ends: 1838 [2024-11-22 20:57:49,758 INFO L226 Difference]: Without dead ends: 1832 [2024-11-22 20:57:49,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:49,758 INFO L432 NwaCegarLoop]: 1137 mSDtfsCounter, 3 mSDsluCounter, 3395 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4532 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:49,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4532 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:57:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2024-11-22 20:57:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1832. [2024-11-22 20:57:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1301 states have (on average 1.8116833205226748) internal successors, (2357), 1788 states have internal predecessors, (2357), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-22 20:57:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2432 transitions. [2024-11-22 20:57:49,774 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2432 transitions. Word has length 89 [2024-11-22 20:57:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:49,774 INFO L471 AbstractCegarLoop]: Abstraction has 1832 states and 2432 transitions. [2024-11-22 20:57:49,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-22 20:57:49,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2432 transitions. [2024-11-22 20:57:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-22 20:57:49,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:49,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:49,783 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-22 20:57:49,975 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-22 20:57:49,976 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:49,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash 400224857, now seen corresponding path program 1 times [2024-11-22 20:57:49,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:49,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004547836] [2024-11-22 20:57:49,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:49,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:49,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:49,978 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-22 20:57:49,979 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-22 20:57:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:50,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 20:57:50,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:50,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:57:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:50,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:50,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004547836] [2024-11-22 20:57:50,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004547836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:57:50,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:57:50,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-22 20:57:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310688390] [2024-11-22 20:57:50,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:57:50,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 20:57:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:50,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 20:57:50,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-22 20:57:50,393 INFO L87 Difference]: Start difference. First operand 1832 states and 2432 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 20:57:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:50,518 INFO L93 Difference]: Finished difference Result 1858 states and 2462 transitions. [2024-11-22 20:57:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 20:57:50,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 90 [2024-11-22 20:57:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:50,522 INFO L225 Difference]: With dead ends: 1858 [2024-11-22 20:57:50,522 INFO L226 Difference]: Without dead ends: 1846 [2024-11-22 20:57:50,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-22 20:57:50,523 INFO L432 NwaCegarLoop]: 1137 mSDtfsCounter, 17 mSDsluCounter, 5660 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6797 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:50,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6797 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 20:57:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-22 20:57:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1840. [2024-11-22 20:57:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1309 states have (on average 1.8082505729564553) internal successors, (2367), 1796 states have internal predecessors, (2367), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-22 20:57:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2442 transitions. [2024-11-22 20:57:50,537 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2442 transitions. Word has length 90 [2024-11-22 20:57:50,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:50,538 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2442 transitions. [2024-11-22 20:57:50,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 20:57:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2442 transitions. [2024-11-22 20:57:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-22 20:57:50,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:50,539 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:50,546 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 (24)] Forceful destruction successful, exit code 0 [2024-11-22 20:57:50,739 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 [2024-11-22 20:57:50,739 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:50,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1962339241, now seen corresponding path program 2 times [2024-11-22 20:57:50,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492011510] [2024-11-22 20:57:50,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 20:57:50,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:50,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:50,742 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:50,742 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 (25)] Waiting until timeout for monitored process [2024-11-22 20:57:51,360 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 20:57:51,360 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:57:51,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 20:57:51,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:51,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:57:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:51,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:51,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492011510] [2024-11-22 20:57:51,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492011510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:57:51,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:57:51,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-22 20:57:51,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944481961] [2024-11-22 20:57:51,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:57:51,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 20:57:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:51,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 20:57:51,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-22 20:57:51,633 INFO L87 Difference]: Start difference. First operand 1840 states and 2442 transitions. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 20:57:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:52,051 INFO L93 Difference]: Finished difference Result 1876 states and 2492 transitions. [2024-11-22 20:57:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-22 20:57:52,053 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 93 [2024-11-22 20:57:52,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:52,055 INFO L225 Difference]: With dead ends: 1876 [2024-11-22 20:57:52,055 INFO L226 Difference]: Without dead ends: 1864 [2024-11-22 20:57:52,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-22 20:57:52,057 INFO L432 NwaCegarLoop]: 1137 mSDtfsCounter, 34 mSDsluCounter, 6798 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 7935 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:52,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 7935 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 20:57:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2024-11-22 20:57:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1858. [2024-11-22 20:57:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1327 states have (on average 1.8018085908063302) internal successors, (2391), 1814 states have internal predecessors, (2391), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-22 20:57:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2466 transitions. [2024-11-22 20:57:52,076 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2466 transitions. Word has length 93 [2024-11-22 20:57:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:52,077 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2466 transitions. [2024-11-22 20:57:52,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 20:57:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2466 transitions. [2024-11-22 20:57:52,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-22 20:57:52,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:52,078 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:52,091 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 (25)] Ended with exit code 0 [2024-11-22 20:57:52,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:52,279 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:52,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:52,279 INFO L85 PathProgramCache]: Analyzing trace with hash 860812567, now seen corresponding path program 3 times [2024-11-22 20:57:52,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:52,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324187512] [2024-11-22 20:57:52,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 20:57:52,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:52,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:52,283 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-22 20:57:52,284 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-22 20:57:53,193 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-22 20:57:53,194 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:57:53,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 20:57:53,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:53,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:57:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:53,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:53,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324187512] [2024-11-22 20:57:53,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324187512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:57:53,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:57:53,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-22 20:57:53,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465172653] [2024-11-22 20:57:53,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:57:53,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 20:57:53,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:53,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 20:57:53,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-11-22 20:57:53,844 INFO L87 Difference]: Start difference. First operand 1858 states and 2466 transitions. Second operand has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 20:57:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:55,413 INFO L93 Difference]: Finished difference Result 1912 states and 2550 transitions. [2024-11-22 20:57:55,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-22 20:57:55,414 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 99 [2024-11-22 20:57:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:55,416 INFO L225 Difference]: With dead ends: 1912 [2024-11-22 20:57:55,417 INFO L226 Difference]: Without dead ends: 1894 [2024-11-22 20:57:55,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-11-22 20:57:55,418 INFO L432 NwaCegarLoop]: 1137 mSDtfsCounter, 79 mSDsluCounter, 13597 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 14734 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:55,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 14734 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 20:57:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2024-11-22 20:57:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1894. [2024-11-22 20:57:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1363 states have (on average 1.7879677182685254) internal successors, (2437), 1850 states have internal predecessors, (2437), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-22 20:57:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2512 transitions. [2024-11-22 20:57:55,432 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2512 transitions. Word has length 99 [2024-11-22 20:57:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:55,432 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2512 transitions. [2024-11-22 20:57:55,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 20:57:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2512 transitions. [2024-11-22 20:57:55,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-22 20:57:55,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:55,433 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:55,446 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-22 20:57:55,633 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-22 20:57:55,633 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:57:55,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash -451672425, now seen corresponding path program 4 times [2024-11-22 20:57:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:55,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907503441] [2024-11-22 20:57:55,634 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 20:57:55,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:55,636 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-22 20:57:55,637 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-22 20:57:56,332 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 20:57:56,333 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:57:56,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 20:57:56,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:56,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:57:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:57,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:57,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907503441] [2024-11-22 20:57:57,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907503441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:57:57,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:57:57,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-22 20:57:57,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375123898] [2024-11-22 20:57:57,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:57:57,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-22 20:57:57,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:57,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-22 20:57:57,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2024-11-22 20:57:57,891 INFO L87 Difference]: Start difference. First operand 1894 states and 2512 transitions. Second operand has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 20:58:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:04,825 INFO L93 Difference]: Finished difference Result 1980 states and 2662 transitions. [2024-11-22 20:58:04,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-22 20:58:04,826 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 111 [2024-11-22 20:58:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:04,830 INFO L225 Difference]: With dead ends: 1980 [2024-11-22 20:58:04,830 INFO L226 Difference]: Without dead ends: 1968 [2024-11-22 20:58:04,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2024-11-22 20:58:04,832 INFO L432 NwaCegarLoop]: 1137 mSDtfsCounter, 96 mSDsluCounter, 29434 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 30571 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:04,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 30571 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 20:58:04,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2024-11-22 20:58:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1962. [2024-11-22 20:58:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1431 states have (on average 1.7672955974842768) internal successors, (2529), 1918 states have internal predecessors, (2529), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-22 20:58:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2604 transitions. [2024-11-22 20:58:04,854 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2604 transitions. Word has length 111 [2024-11-22 20:58:04,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:04,854 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2604 transitions. [2024-11-22 20:58:04,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 20:58:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2604 transitions. [2024-11-22 20:58:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 20:58:04,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:04,855 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:04,870 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 (27)] Forceful destruction successful, exit code 0 [2024-11-22 20:58:05,056 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-22 20:58:05,057 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-22 20:58:05,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash 508361047, now seen corresponding path program 5 times [2024-11-22 20:58:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:05,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788108689] [2024-11-22 20:58:05,059 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 20:58:05,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:58:05,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:05,061 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-22 20:58:05,062 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-22 20:58:06,333 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-22 20:58:06,333 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:58:06,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-22 20:58:06,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:06,373 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-22 20:58:06,465 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-22 20:58:06,466 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 19 treesize of output 27 [2024-11-22 20:58:06,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 20:58:06,560 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 24 treesize of output 12 [2024-11-22 20:58:07,459 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:58:07,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-22 20:58:07,497 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 33 treesize of output 15 [2024-11-22 20:58:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2024-11-22 20:58:07,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:58:07,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:07,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788108689] [2024-11-22 20:58:07,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788108689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:58:07,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2100608731] [2024-11-22 20:58:07,797 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 20:58:07,798 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 20:58:07,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 20:58:07,799 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-22 20:58:07,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process