./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 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_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.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:44:36,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:44:36,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:44:36,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:44:36,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:44:36,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:44:36,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:44:36,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:44:36,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:44:36,479 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:44:36,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:44:36,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:44:36,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:44:36,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:44:36,481 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:44:36,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:44:36,482 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:44:36,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:44:36,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:44:36,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:44:36,483 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:44:36,486 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:44:36,486 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:44:36,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:44:36,486 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:44:36,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:44:36,487 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:44:36,487 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:44:36,487 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:44:36,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:44:36,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:44:36,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:44:36,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:44:36,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:44:36,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:44:36,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:44:36,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:44:36,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:44:36,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:44:36,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:44:36,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:44:36,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:44:36,491 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-17 02:44:36,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:44:36,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:44:36,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:44:36,790 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:44:36,791 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:44:36,791 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-17 02:44:38,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:44:38,447 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:44:38,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-11-17 02:44:38,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/287d6f5a2/d1a7755fdeee43e6a96e194cb9270f4e/FLAG249feac5e [2024-11-17 02:44:38,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/287d6f5a2/d1a7755fdeee43e6a96e194cb9270f4e [2024-11-17 02:44:38,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:44:38,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:44:38,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:44:38,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:44:38,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:44:38,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:44:38" (1/1) ... [2024-11-17 02:44:38,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ff594a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:38, skipping insertion in model container [2024-11-17 02:44:38,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:44:38" (1/1) ... [2024-11-17 02:44:38,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:44:38,941 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:38,970 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:38,972 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:38,975 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:38,981 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,026 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,029 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,031 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,031 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,042 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,043 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,044 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,045 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,048 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,051 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,056 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,057 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,061 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,062 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,066 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:39,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:44:39,088 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-17 02:44:39,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5b0201a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:39, skipping insertion in model container [2024-11-17 02:44:39,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:44:39,089 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 02:44:39,091 INFO L158 Benchmark]: Toolchain (without parser) took 606.45ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 72.8MB in the beginning and 225.0MB in the end (delta: -152.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-11-17 02:44:39,091 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 02:44:39,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.32ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 72.4MB in the beginning and 225.0MB in the end (delta: -152.6MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-11-17 02:44:39,100 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.14ms. Allocated memory is still 146.8MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.32ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 72.4MB in the beginning and 225.0MB in the end (delta: -152.6MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_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.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:44:40,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:44:40,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 02:44:40,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:44:40,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:44:41,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:44:41,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:44:41,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:44:41,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:44:41,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:44:41,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:44:41,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:44:41,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:44:41,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:44:41,021 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:44:41,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:44:41,025 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:44:41,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:44:41,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:44:41,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:44:41,026 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:44:41,026 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:44:41,026 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:44:41,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:44:41,027 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:44:41,027 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 02:44:41,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:44:41,027 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 02:44:41,027 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:44:41,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:44:41,029 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:44:41,029 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:44:41,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:44:41,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:44:41,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:44:41,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:44:41,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:44:41,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:44:41,031 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 02:44:41,032 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 02:44:41,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:44:41,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:44:41,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:44:41,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:44:41,033 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-17 02:44:41,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:44:41,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:44:41,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:44:41,352 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:44:41,356 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:44:41,357 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-17 02:44:43,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:44:43,328 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:44:43,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-11-17 02:44:43,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519658536/b06c8378cb5c437ca832a50328e4fce7/FLAGa7d4f75e0 [2024-11-17 02:44:43,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519658536/b06c8378cb5c437ca832a50328e4fce7 [2024-11-17 02:44:43,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:44:43,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:44:43,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:44:43,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:44:43,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:44:43,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:44:43" (1/1) ... [2024-11-17 02:44:43,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5685432a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:43, skipping insertion in model container [2024-11-17 02:44:43,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:44:43" (1/1) ... [2024-11-17 02:44:43,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:44:43,836 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,868 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,873 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,879 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,884 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,904 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,904 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,906 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,906 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,908 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,909 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,912 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,912 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,915 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,916 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,918 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,918 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,919 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,919 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,922 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:43,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:44:43,942 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 02:44:43,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:44:43,995 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,010 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,014 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,016 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,022 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,064 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,067 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,069 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,069 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,071 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,075 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,076 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,076 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,078 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,079 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,084 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,084 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,085 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,085 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,091 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:44:44,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:44:44,100 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:44:44,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:44:44,260 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:44:44,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44 WrapperNode [2024-11-17 02:44:44,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:44:44,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:44:44,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:44:44,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:44:44,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44" (1/1) ... [2024-11-17 02:44:44,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44" (1/1) ... [2024-11-17 02:44:44,376 INFO L138 Inliner]: procedures = 286, calls = 353, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1203 [2024-11-17 02:44:44,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:44:44,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:44:44,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:44:44,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:44:44,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44" (1/1) ... [2024-11-17 02:44:44,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44" (1/1) ... [2024-11-17 02:44:44,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44" (1/1) ... [2024-11-17 02:44:44,529 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [34, 2, 12, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [0, 2, 10, 0]. The 62 writes are split as follows [4, 0, 1, 57]. [2024-11-17 02:44:44,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44" (1/1) ... [2024-11-17 02:44:44,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44" (1/1) ... [2024-11-17 02:44:44,572 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44" (1/1) ... [2024-11-17 02:44:44,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44" (1/1) ... [2024-11-17 02:44:44,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44" (1/1) ... [2024-11-17 02:44:44,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44" (1/1) ... [2024-11-17 02:44:44,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:44:44,591 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:44:44,591 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:44:44,591 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:44:44,592 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44" (1/1) ... [2024-11-17 02:44:44,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:44:44,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:44:44,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 02:44:44,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 02:44:44,670 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 02:44:44,671 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 02:44:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 02:44:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 02:44:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 02:44:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-17 02:44:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 02:44:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 02:44:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 02:44:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-17 02:44:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 02:44:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:44:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:44:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 02:44:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-17 02:44:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:44:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 02:44:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 02:44:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 02:44:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-17 02:44:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 02:44:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 02:44:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 02:44:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-17 02:44:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-17 02:44:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-17 02:44:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-17 02:44:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-17 02:44:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-17 02:44:44,677 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-17 02:44:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 02:44:44,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 02:44:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:44:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:44:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-17 02:44:44,678 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-17 02:44:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:44:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:44:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 02:44:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-17 02:44:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-17 02:44:44,678 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-17 02:44:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:44:44,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:44:44,864 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:44:44,866 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:44:44,933 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2024-11-17 02:44:47,908 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2024-11-17 02:44:47,909 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2024-11-17 02:44:47,909 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 02:44:48,015 INFO L? ?]: Removed 1306 outVars from TransFormulas that were not future-live. [2024-11-17 02:44:48,015 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:44:48,041 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:44:48,042 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 02:44:48,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:44:48 BoogieIcfgContainer [2024-11-17 02:44:48,042 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:44:48,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:44:48,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:44:48,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:44:48,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:44:43" (1/3) ... [2024-11-17 02:44:48,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281957fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:44:48, skipping insertion in model container [2024-11-17 02:44:48,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:44:44" (2/3) ... [2024-11-17 02:44:48,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281957fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:44:48, skipping insertion in model container [2024-11-17 02:44:48,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:44:48" (3/3) ... [2024-11-17 02:44:48,049 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-2.i [2024-11-17 02:44:48,062 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:44:48,063 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 625 error locations. [2024-11-17 02:44:48,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:44:48,118 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;@2ff92136, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:44:48,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 625 error locations. [2024-11-17 02:44:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 1315 states, 664 states have (on average 2.161144578313253) internal successors, (1435), 1293 states have internal predecessors, (1435), 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-17 02:44:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 02:44:48,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:48,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 02:44:48,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:44:48,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:48,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1476558, now seen corresponding path program 1 times [2024-11-17 02:44:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:48,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130239943] [2024-11-17 02:44:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:48,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:48,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:48,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:44:48,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 02:44:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:48,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:44:48,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:48,336 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-17 02:44:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:48,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:48,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:48,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130239943] [2024-11-17 02:44:48,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130239943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:48,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:48,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:44:48,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128863335] [2024-11-17 02:44:48,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:48,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:44:48,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:48,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:44:48,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:44:48,376 INFO L87 Difference]: Start difference. First operand has 1315 states, 664 states have (on average 2.161144578313253) internal successors, (1435), 1293 states have internal predecessors, (1435), 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-17 02:44:49,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:49,903 INFO L93 Difference]: Finished difference Result 1583 states and 1676 transitions. [2024-11-17 02:44:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:44:49,906 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-17 02:44:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:49,935 INFO L225 Difference]: With dead ends: 1583 [2024-11-17 02:44:49,935 INFO L226 Difference]: Without dead ends: 1580 [2024-11-17 02:44:49,936 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-17 02:44:49,942 INFO L432 NwaCegarLoop]: 940 mSDtfsCounter, 939 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:49,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 1299 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:44:49,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-11-17 02:44:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1337. [2024-11-17 02:44:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 702 states have (on average 2.02991452991453) internal successors, (1425), 1317 states have internal predecessors, (1425), 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-17 02:44:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1459 transitions. [2024-11-17 02:44:50,034 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1459 transitions. Word has length 3 [2024-11-17 02:44:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:50,034 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1459 transitions. [2024-11-17 02:44:50,034 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-17 02:44:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1459 transitions. [2024-11-17 02:44:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 02:44:50,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:50,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 02:44:50,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 02:44:50,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:50,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:44:50,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1476559, now seen corresponding path program 1 times [2024-11-17 02:44:50,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:50,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972751859] [2024-11-17 02:44:50,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:50,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:50,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:50,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:44:50,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 02:44:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:50,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:44:50,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:50,400 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-17 02:44:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:50,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:50,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:50,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972751859] [2024-11-17 02:44:50,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972751859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:50,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:50,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:44:50,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589108308] [2024-11-17 02:44:50,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:50,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:44:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:50,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:44:50,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:44:50,421 INFO L87 Difference]: Start difference. First operand 1337 states and 1459 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-17 02:44:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:52,511 INFO L93 Difference]: Finished difference Result 1958 states and 2130 transitions. [2024-11-17 02:44:52,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:44:52,511 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-17 02:44:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:52,516 INFO L225 Difference]: With dead ends: 1958 [2024-11-17 02:44:52,516 INFO L226 Difference]: Without dead ends: 1958 [2024-11-17 02:44:52,516 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-17 02:44:52,517 INFO L432 NwaCegarLoop]: 1078 mSDtfsCounter, 654 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:52,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1819 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-17 02:44:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2024-11-17 02:44:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1563. [2024-11-17 02:44:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 927 states have (on average 2.0097087378640777) internal successors, (1863), 1541 states have internal predecessors, (1863), 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-17 02:44:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1901 transitions. [2024-11-17 02:44:52,546 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1901 transitions. Word has length 3 [2024-11-17 02:44:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:52,546 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 1901 transitions. [2024-11-17 02:44:52,546 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-17 02:44:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1901 transitions. [2024-11-17 02:44:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:44:52,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:52,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:44:52,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 02:44:52,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:52,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:44:52,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:52,751 INFO L85 PathProgramCache]: Analyzing trace with hash -610856126, now seen corresponding path program 1 times [2024-11-17 02:44:52,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:52,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358459949] [2024-11-17 02:44:52,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:52,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:52,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:52,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:44:52,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 02:44:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:52,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 02:44:52,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:52,926 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-17 02:44:52,938 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-17 02:44:53,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:44:53,043 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-17 02:44:53,056 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:44:53,056 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-17 02:44:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:53,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:53,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:53,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358459949] [2024-11-17 02:44:53,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358459949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:53,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:53,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:44:53,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603276186] [2024-11-17 02:44:53,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:53,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:44:53,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:53,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:44:53,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:44:53,083 INFO L87 Difference]: Start difference. First operand 1563 states and 1901 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-17 02:44:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:56,010 INFO L93 Difference]: Finished difference Result 2679 states and 3098 transitions. [2024-11-17 02:44:56,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:44:56,011 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-17 02:44:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:56,028 INFO L225 Difference]: With dead ends: 2679 [2024-11-17 02:44:56,029 INFO L226 Difference]: Without dead ends: 2679 [2024-11-17 02:44:56,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-17 02:44:56,029 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 2093 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:56,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2099 Valid, 1535 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-17 02:44:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2024-11-17 02:44:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 1717. [2024-11-17 02:44:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1081 states have (on average 1.9935245143385754) internal successors, (2155), 1695 states have internal predecessors, (2155), 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-17 02:44:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2193 transitions. [2024-11-17 02:44:56,059 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2193 transitions. Word has length 9 [2024-11-17 02:44:56,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:56,060 INFO L471 AbstractCegarLoop]: Abstraction has 1717 states and 2193 transitions. [2024-11-17 02:44:56,060 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-17 02:44:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2193 transitions. [2024-11-17 02:44:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 02:44:56,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:56,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:44:56,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 02:44:56,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:56,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr607REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:44:56,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:56,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1756669350, now seen corresponding path program 1 times [2024-11-17 02:44:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:56,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805463510] [2024-11-17 02:44:56,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:56,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:56,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:56,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:44:56,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 02:44:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:56,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:44:56,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:56,380 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-17 02:44:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:56,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:56,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:56,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805463510] [2024-11-17 02:44:56,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805463510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:56,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:56,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:44:56,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078217072] [2024-11-17 02:44:56,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:56,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:44:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:56,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:44:56,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:44:56,396 INFO L87 Difference]: Start difference. First operand 1717 states and 2193 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:44:58,035 INFO L93 Difference]: Finished difference Result 2289 states and 2993 transitions. [2024-11-17 02:44:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:44:58,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-17 02:44:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:44:58,045 INFO L225 Difference]: With dead ends: 2289 [2024-11-17 02:44:58,045 INFO L226 Difference]: Without dead ends: 2289 [2024-11-17 02:44:58,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:44:58,047 INFO L432 NwaCegarLoop]: 1269 mSDtfsCounter, 946 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 2618 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:44:58,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 2618 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 02:44:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2024-11-17 02:44:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1672. [2024-11-17 02:44:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1081 states have (on average 1.938945420906568) internal successors, (2096), 1650 states have internal predecessors, (2096), 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-17 02:44:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2134 transitions. [2024-11-17 02:44:58,072 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2134 transitions. Word has length 10 [2024-11-17 02:44:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:44:58,073 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 2134 transitions. [2024-11-17 02:44:58,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:44:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2134 transitions. [2024-11-17 02:44:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 02:44:58,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:44:58,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:44:58,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-17 02:44:58,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:58,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr608REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:44:58,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:44:58,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1756669349, now seen corresponding path program 1 times [2024-11-17 02:44:58,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:44:58,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5715497] [2024-11-17 02:44:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:44:58,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:44:58,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:44:58,278 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:44:58,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 02:44:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:44:58,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 02:44:58,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:44:58,418 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-17 02:44:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:44:58,447 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:44:58,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:44:58,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5715497] [2024-11-17 02:44:58,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5715497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:44:58,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:44:58,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:44:58,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918585636] [2024-11-17 02:44:58,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:44:58,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:44:58,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:44:58,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:44:58,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:44:58,449 INFO L87 Difference]: Start difference. First operand 1672 states and 2134 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:45:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:00,812 INFO L93 Difference]: Finished difference Result 2354 states and 3016 transitions. [2024-11-17 02:45:00,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:45:00,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-17 02:45:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:00,825 INFO L225 Difference]: With dead ends: 2354 [2024-11-17 02:45:00,826 INFO L226 Difference]: Without dead ends: 2354 [2024-11-17 02:45:00,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:45:00,826 INFO L432 NwaCegarLoop]: 1446 mSDtfsCounter, 723 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:00,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 2983 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-17 02:45:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2024-11-17 02:45:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 1664. [2024-11-17 02:45:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1083 states have (on average 1.915050784856879) internal successors, (2074), 1642 states have internal predecessors, (2074), 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-17 02:45:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2112 transitions. [2024-11-17 02:45:00,846 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2112 transitions. Word has length 10 [2024-11-17 02:45:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:00,847 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2112 transitions. [2024-11-17 02:45:00,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:45:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2112 transitions. [2024-11-17 02:45:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 02:45:00,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:00,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:45:00,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-17 02:45:01,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:01,048 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-17 02:45:01,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:01,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1224117696, now seen corresponding path program 1 times [2024-11-17 02:45:01,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:01,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750649829] [2024-11-17 02:45:01,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:01,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:01,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:01,052 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:45:01,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 02:45:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:01,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:45:01,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:01,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:01,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:01,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750649829] [2024-11-17 02:45:01,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750649829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:01,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:01,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:45:01,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403535912] [2024-11-17 02:45:01,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:01,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:45:01,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:01,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:45:01,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:45:01,230 INFO L87 Difference]: Start difference. First operand 1664 states and 2112 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-17 02:45:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:01,788 INFO L93 Difference]: Finished difference Result 2306 states and 2899 transitions. [2024-11-17 02:45:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:45:01,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 16 [2024-11-17 02:45:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:01,803 INFO L225 Difference]: With dead ends: 2306 [2024-11-17 02:45:01,803 INFO L226 Difference]: Without dead ends: 2306 [2024-11-17 02:45:01,807 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-17 02:45:01,808 INFO L432 NwaCegarLoop]: 1489 mSDtfsCounter, 655 mSDsluCounter, 2561 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 4050 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-17 02:45:01,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 4050 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:45:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2024-11-17 02:45:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1936. [2024-11-17 02:45:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1352 states have (on average 1.9230769230769231) internal successors, (2600), 1911 states have internal predecessors, (2600), 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-17 02:45:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2644 transitions. [2024-11-17 02:45:01,832 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2644 transitions. Word has length 16 [2024-11-17 02:45:01,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:01,832 INFO L471 AbstractCegarLoop]: Abstraction has 1936 states and 2644 transitions. [2024-11-17 02:45:01,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-17 02:45:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2644 transitions. [2024-11-17 02:45:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 02:45:01,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:01,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:45:01,838 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-17 02:45:02,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:02,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr291REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:02,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1224364623, now seen corresponding path program 1 times [2024-11-17 02:45:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:02,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108073050] [2024-11-17 02:45:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:02,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:02,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:02,041 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:45:02,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 02:45:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:02,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 02:45:02,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:02,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:02,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:02,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108073050] [2024-11-17 02:45:02,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108073050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:02,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:02,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:45:02,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733048538] [2024-11-17 02:45:02,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:02,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:45:02,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:02,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:45:02,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:45:02,168 INFO L87 Difference]: Start difference. First operand 1936 states and 2644 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:45:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:02,191 INFO L93 Difference]: Finished difference Result 1840 states and 2472 transitions. [2024-11-17 02:45:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:45:02,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-17 02:45:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:02,195 INFO L225 Difference]: With dead ends: 1840 [2024-11-17 02:45:02,196 INFO L226 Difference]: Without dead ends: 1840 [2024-11-17 02:45:02,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:45:02,196 INFO L432 NwaCegarLoop]: 1259 mSDtfsCounter, 71 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2454 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-17 02:45:02,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2454 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:45:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2024-11-17 02:45:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2024-11-17 02:45:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1280 states have (on average 1.896875) internal successors, (2428), 1815 states have internal predecessors, (2428), 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-17 02:45:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2472 transitions. [2024-11-17 02:45:02,216 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2472 transitions. Word has length 16 [2024-11-17 02:45:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:02,216 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2472 transitions. [2024-11-17 02:45:02,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:45:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2472 transitions. [2024-11-17 02:45:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 02:45:02,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:02,217 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-17 02:45:02,221 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-17 02:45:02,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:02,418 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-17 02:45:02,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash -429465059, now seen corresponding path program 1 times [2024-11-17 02:45:02,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:02,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208745804] [2024-11-17 02:45:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:02,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:02,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:02,422 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:45:02,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 02:45:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:02,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:45:02,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:02,571 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:45:02,572 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:45:02,572 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:45:02,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-17 02:45:02,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 02:45:02,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 02:45:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:02,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:02,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:02,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208745804] [2024-11-17 02:45:02,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208745804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:02,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:02,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:45:02,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657574617] [2024-11-17 02:45:02,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:02,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:45:02,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:02,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:45:02,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:45:02,638 INFO L87 Difference]: Start difference. First operand 1840 states and 2472 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:45:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:02,898 INFO L93 Difference]: Finished difference Result 2573 states and 3007 transitions. [2024-11-17 02:45:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:45:02,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 02:45:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:02,904 INFO L225 Difference]: With dead ends: 2573 [2024-11-17 02:45:02,904 INFO L226 Difference]: Without dead ends: 2573 [2024-11-17 02:45:02,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:45:02,905 INFO L432 NwaCegarLoop]: 1454 mSDtfsCounter, 1132 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 4126 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-17 02:45:02,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 4126 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:45:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2024-11-17 02:45:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1488. [2024-11-17 02:45:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 930 states have (on average 1.8903225806451613) internal successors, (1758), 1465 states have internal predecessors, (1758), 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-17 02:45:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1798 transitions. [2024-11-17 02:45:02,920 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1798 transitions. Word has length 19 [2024-11-17 02:45:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:02,921 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1798 transitions. [2024-11-17 02:45:02,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:45:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1798 transitions. [2024-11-17 02:45:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 02:45:02,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:02,921 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-17 02:45:02,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-17 02:45:03,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:03,126 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr599REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:03,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:03,126 INFO L85 PathProgramCache]: Analyzing trace with hash 175635572, now seen corresponding path program 1 times [2024-11-17 02:45:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:03,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817139619] [2024-11-17 02:45:03,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:03,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:03,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:03,131 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:45:03,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 02:45:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:03,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 02:45:03,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:03,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:03,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:03,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817139619] [2024-11-17 02:45:03,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817139619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:03,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:03,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:45:03,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164647237] [2024-11-17 02:45:03,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:03,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:45:03,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:03,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:45:03,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:45:03,324 INFO L87 Difference]: Start difference. First operand 1488 states and 1798 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-17 02:45:03,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:03,379 INFO L93 Difference]: Finished difference Result 1428 states and 1712 transitions. [2024-11-17 02:45:03,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:45:03,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-17 02:45:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:03,383 INFO L225 Difference]: With dead ends: 1428 [2024-11-17 02:45:03,383 INFO L226 Difference]: Without dead ends: 1428 [2024-11-17 02:45:03,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:45:03,384 INFO L432 NwaCegarLoop]: 1216 mSDtfsCounter, 71 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2368 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-17 02:45:03,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2368 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:45:03,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-11-17 02:45:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2024-11-17 02:45:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 894 states have (on average 1.8702460850111857) internal successors, (1672), 1405 states have internal predecessors, (1672), 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-17 02:45:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1712 transitions. [2024-11-17 02:45:03,400 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1712 transitions. Word has length 21 [2024-11-17 02:45:03,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:03,401 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1712 transitions. [2024-11-17 02:45:03,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-17 02:45:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1712 transitions. [2024-11-17 02:45:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 02:45:03,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:03,401 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] [2024-11-17 02:45:03,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 02:45:03,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:03,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr575REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:03,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1282032712, now seen corresponding path program 1 times [2024-11-17 02:45:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:03,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300342971] [2024-11-17 02:45:03,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:03,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:03,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:03,608 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:45:03,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-17 02:45:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:03,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:45:03,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:03,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:03,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:03,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300342971] [2024-11-17 02:45:03,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300342971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:03,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:03,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:45:03,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669050453] [2024-11-17 02:45:03,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:03,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:45:03,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:03,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:45:03,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:45:03,790 INFO L87 Difference]: Start difference. First operand 1428 states and 1712 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:45:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:03,854 INFO L93 Difference]: Finished difference Result 1398 states and 1654 transitions. [2024-11-17 02:45:03,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:45:03,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-17 02:45:03,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:03,860 INFO L225 Difference]: With dead ends: 1398 [2024-11-17 02:45:03,860 INFO L226 Difference]: Without dead ends: 1398 [2024-11-17 02:45:03,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:45:03,861 INFO L432 NwaCegarLoop]: 1171 mSDtfsCounter, 48 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3486 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-17 02:45:03,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3486 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:45:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-11-17 02:45:03,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2024-11-17 02:45:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 878 states have (on average 1.8382687927107062) internal successors, (1614), 1375 states have internal predecessors, (1614), 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-17 02:45:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1654 transitions. [2024-11-17 02:45:03,888 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1654 transitions. Word has length 23 [2024-11-17 02:45:03,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:03,888 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1654 transitions. [2024-11-17 02:45:03,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:45:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1654 transitions. [2024-11-17 02:45:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 02:45:03,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:03,891 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] [2024-11-17 02:45:03,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-17 02:45:04,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:04,092 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr561REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:04,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:04,094 INFO L85 PathProgramCache]: Analyzing trace with hash 328806238, now seen corresponding path program 1 times [2024-11-17 02:45:04,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:04,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374359274] [2024-11-17 02:45:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:04,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:04,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:04,100 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:45:04,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 02:45:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:04,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:45:04,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:04,298 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-17 02:45:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:04,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:04,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:04,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374359274] [2024-11-17 02:45:04,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374359274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:04,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:04,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:45:04,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277424844] [2024-11-17 02:45:04,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:04,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:45:04,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:04,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:45:04,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:45:04,358 INFO L87 Difference]: Start difference. First operand 1398 states and 1654 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:45:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:06,284 INFO L93 Difference]: Finished difference Result 1839 states and 2216 transitions. [2024-11-17 02:45:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:45:06,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-17 02:45:06,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:06,289 INFO L225 Difference]: With dead ends: 1839 [2024-11-17 02:45:06,289 INFO L226 Difference]: Without dead ends: 1839 [2024-11-17 02:45:06,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-17 02:45:06,290 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 836 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:06,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 2391 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 02:45:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2024-11-17 02:45:06,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1394. [2024-11-17 02:45:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 878 states have (on average 1.8291571753986333) internal successors, (1606), 1371 states have internal predecessors, (1606), 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-17 02:45:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1646 transitions. [2024-11-17 02:45:06,314 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1646 transitions. Word has length 37 [2024-11-17 02:45:06,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:06,315 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1646 transitions. [2024-11-17 02:45:06,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:45:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1646 transitions. [2024-11-17 02:45:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 02:45:06,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:06,317 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] [2024-11-17 02:45:06,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-17 02:45:06,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:06,518 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr562REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:06,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash 328806239, now seen corresponding path program 1 times [2024-11-17 02:45:06,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:06,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976879808] [2024-11-17 02:45:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:06,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:06,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:06,525 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:45:06,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-17 02:45:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:06,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 02:45:06,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:06,714 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-17 02:45:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:06,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:06,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:06,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976879808] [2024-11-17 02:45:06,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976879808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:06,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:06,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:45:06,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544875097] [2024-11-17 02:45:06,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:06,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:45:06,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:06,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:45:06,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:45:06,898 INFO L87 Difference]: Start difference. First operand 1394 states and 1646 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:45:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:09,732 INFO L93 Difference]: Finished difference Result 1965 states and 2344 transitions. [2024-11-17 02:45:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:45:09,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-17 02:45:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:09,738 INFO L225 Difference]: With dead ends: 1965 [2024-11-17 02:45:09,738 INFO L226 Difference]: Without dead ends: 1965 [2024-11-17 02:45:09,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-17 02:45:09,739 INFO L432 NwaCegarLoop]: 1432 mSDtfsCounter, 609 mSDsluCounter, 2383 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 3815 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:09,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 3815 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-17 02:45:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-17 02:45:09,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1390. [2024-11-17 02:45:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 878 states have (on average 1.8200455580865604) internal successors, (1598), 1367 states have internal predecessors, (1598), 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-17 02:45:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1638 transitions. [2024-11-17 02:45:09,753 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1638 transitions. Word has length 37 [2024-11-17 02:45:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:09,753 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1638 transitions. [2024-11-17 02:45:09,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:45:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1638 transitions. [2024-11-17 02:45:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-17 02:45:09,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:09,754 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] [2024-11-17 02:45:09,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-17 02:45:09,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:09,954 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-17 02:45:09,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:09,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1735593719, now seen corresponding path program 1 times [2024-11-17 02:45:09,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:09,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947762050] [2024-11-17 02:45:09,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:09,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:09,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:09,956 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:45:09,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-17 02:45:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:10,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:45:10,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:10,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:10,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:10,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947762050] [2024-11-17 02:45:10,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947762050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:10,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:10,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:45:10,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993383066] [2024-11-17 02:45:10,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:10,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:45:10,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:10,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:45:10,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:45:10,254 INFO L87 Difference]: Start difference. First operand 1390 states and 1638 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-17 02:45:10,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:10,309 INFO L93 Difference]: Finished difference Result 1378 states and 1618 transitions. [2024-11-17 02:45:10,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:45:10,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 59 [2024-11-17 02:45:10,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:10,316 INFO L225 Difference]: With dead ends: 1378 [2024-11-17 02:45:10,316 INFO L226 Difference]: Without dead ends: 1378 [2024-11-17 02:45:10,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:45:10,317 INFO L432 NwaCegarLoop]: 1165 mSDtfsCounter, 21 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3463 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-17 02:45:10,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3463 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:45:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-17 02:45:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2024-11-17 02:45:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 866 states have (on average 1.8221709006928406) internal successors, (1578), 1355 states have internal predecessors, (1578), 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-17 02:45:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1618 transitions. [2024-11-17 02:45:10,337 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1618 transitions. Word has length 59 [2024-11-17 02:45:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:10,337 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1618 transitions. [2024-11-17 02:45:10,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-17 02:45:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1618 transitions. [2024-11-17 02:45:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-17 02:45:10,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:10,340 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] [2024-11-17 02:45:10,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-17 02:45:10,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:10,541 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-17 02:45:10,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:10,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1413574463, now seen corresponding path program 1 times [2024-11-17 02:45:10,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:10,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911910254] [2024-11-17 02:45:10,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:10,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:10,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:10,544 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:45:10,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-17 02:45:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:10,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 02:45:10,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:10,888 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-17 02:45:10,888 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-17 02:45:10,934 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-17 02:45:10,934 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-17 02:45:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:11,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:11,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:11,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911910254] [2024-11-17 02:45:11,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911910254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:11,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:11,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:45:11,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317847748] [2024-11-17 02:45:11,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:11,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:45:11,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:11,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:45:11,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:45:11,338 INFO L87 Difference]: Start difference. First operand 1378 states and 1618 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-17 02:45:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:14,433 INFO L93 Difference]: Finished difference Result 2522 states and 2958 transitions. [2024-11-17 02:45:14,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:45:14,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 67 [2024-11-17 02:45:14,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:14,438 INFO L225 Difference]: With dead ends: 2522 [2024-11-17 02:45:14,438 INFO L226 Difference]: Without dead ends: 2522 [2024-11-17 02:45:14,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 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-17 02:45:14,439 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 1016 mSDsluCounter, 2727 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 3652 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:14,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 3652 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-17 02:45:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2024-11-17 02:45:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 1850. [2024-11-17 02:45:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1322 states have (on average 1.8055975794251136) internal successors, (2387), 1814 states have internal predecessors, (2387), 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-17 02:45:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2453 transitions. [2024-11-17 02:45:14,482 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2453 transitions. Word has length 67 [2024-11-17 02:45:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:14,482 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 2453 transitions. [2024-11-17 02:45:14,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-17 02:45:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2453 transitions. [2024-11-17 02:45:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-17 02:45:14,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:14,482 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] [2024-11-17 02:45:14,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-17 02:45:14,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:14,683 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-17 02:45:14,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1413574464, now seen corresponding path program 1 times [2024-11-17 02:45:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538426246] [2024-11-17 02:45:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:14,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:14,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:14,687 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:45:14,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-17 02:45:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:15,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 02:45:15,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:15,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:45:15,129 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-17 02:45:15,232 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 02:45:15,232 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-17 02:45:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:15,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:15,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:15,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538426246] [2024-11-17 02:45:15,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538426246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:15,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:15,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:45:15,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288970949] [2024-11-17 02:45:15,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:15,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:45:15,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:15,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:45:15,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:45:15,727 INFO L87 Difference]: Start difference. First operand 1850 states and 2453 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-17 02:45:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:18,074 INFO L93 Difference]: Finished difference Result 1856 states and 2460 transitions. [2024-11-17 02:45:18,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:45:18,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 67 [2024-11-17 02:45:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:18,078 INFO L225 Difference]: With dead ends: 1856 [2024-11-17 02:45:18,078 INFO L226 Difference]: Without dead ends: 1856 [2024-11-17 02:45:18,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 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-17 02:45:18,078 INFO L432 NwaCegarLoop]: 1160 mSDtfsCounter, 62 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:18,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 3064 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-17 02:45:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2024-11-17 02:45:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1856. [2024-11-17 02:45:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1327 states have (on average 1.8025621703089676) internal successors, (2392), 1819 states have internal predecessors, (2392), 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-17 02:45:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2460 transitions. [2024-11-17 02:45:18,097 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2460 transitions. Word has length 67 [2024-11-17 02:45:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:18,097 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2460 transitions. [2024-11-17 02:45:18,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-17 02:45:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2460 transitions. [2024-11-17 02:45:18,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-17 02:45:18,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:18,098 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] [2024-11-17 02:45:18,108 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 (16)] Forceful destruction successful, exit code 0 [2024-11-17 02:45:18,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:18,302 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-17 02:45:18,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:18,302 INFO L85 PathProgramCache]: Analyzing trace with hash -481187710, now seen corresponding path program 1 times [2024-11-17 02:45:18,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:18,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119115515] [2024-11-17 02:45:18,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:18,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:18,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:18,305 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:45:18,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-17 02:45:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:18,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:45:18,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:18,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:18,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:18,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119115515] [2024-11-17 02:45:18,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119115515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:18,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:18,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:45:18,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062900923] [2024-11-17 02:45:18,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:18,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:45:18,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:18,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:45:18,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:45:18,565 INFO L87 Difference]: Start difference. First operand 1856 states and 2460 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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-17 02:45:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:18,654 INFO L93 Difference]: Finished difference Result 1882 states and 2487 transitions. [2024-11-17 02:45:18,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:45:18,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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 75 [2024-11-17 02:45:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:18,658 INFO L225 Difference]: With dead ends: 1882 [2024-11-17 02:45:18,658 INFO L226 Difference]: Without dead ends: 1882 [2024-11-17 02:45:18,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 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-17 02:45:18,664 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 15 mSDsluCounter, 4695 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5870 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-17 02:45:18,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5870 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:45:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2024-11-17 02:45:18,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1880. [2024-11-17 02:45:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1345 states have (on average 1.795539033457249) internal successors, (2415), 1839 states have internal predecessors, (2415), 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-17 02:45:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2487 transitions. [2024-11-17 02:45:18,700 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2487 transitions. Word has length 75 [2024-11-17 02:45:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:18,700 INFO L471 AbstractCegarLoop]: Abstraction has 1880 states and 2487 transitions. [2024-11-17 02:45:18,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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-17 02:45:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2487 transitions. [2024-11-17 02:45:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 02:45:18,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:18,701 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] [2024-11-17 02:45:18,710 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-17 02:45:18,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:18,906 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:18,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:18,907 INFO L85 PathProgramCache]: Analyzing trace with hash 344424323, now seen corresponding path program 1 times [2024-11-17 02:45:18,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:18,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841232790] [2024-11-17 02:45:18,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:18,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:18,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:18,909 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:45:18,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-17 02:45:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:19,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:45:19,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:19,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:19,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:19,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841232790] [2024-11-17 02:45:19,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841232790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:19,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:19,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 02:45:19,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955126689] [2024-11-17 02:45:19,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:19,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:45:19,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:19,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:45:19,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:45:19,360 INFO L87 Difference]: Start difference. First operand 1880 states and 2487 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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-17 02:45:19,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:19,756 INFO L93 Difference]: Finished difference Result 1892 states and 2501 transitions. [2024-11-17 02:45:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 02:45:19,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 73 [2024-11-17 02:45:19,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:19,762 INFO L225 Difference]: With dead ends: 1892 [2024-11-17 02:45:19,762 INFO L226 Difference]: Without dead ends: 1892 [2024-11-17 02:45:19,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 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-17 02:45:19,763 INFO L432 NwaCegarLoop]: 1158 mSDtfsCounter, 23 mSDsluCounter, 4532 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 5690 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:19,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 5690 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 02:45:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2024-11-17 02:45:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1883. [2024-11-17 02:45:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1347 states have (on average 1.7943578322197475) internal successors, (2417), 1841 states have internal predecessors, (2417), 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-17 02:45:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2490 transitions. [2024-11-17 02:45:19,797 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2490 transitions. Word has length 73 [2024-11-17 02:45:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:19,798 INFO L471 AbstractCegarLoop]: Abstraction has 1883 states and 2490 transitions. [2024-11-17 02:45:19,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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-17 02:45:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2490 transitions. [2024-11-17 02:45:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 02:45:19,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:19,801 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] [2024-11-17 02:45:19,809 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 (18)] Forceful destruction successful, exit code 0 [2024-11-17 02:45:20,001 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-17 02:45:20,002 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:20,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1635836253, now seen corresponding path program 1 times [2024-11-17 02:45:20,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:20,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632781890] [2024-11-17 02:45:20,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:20,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:20,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:20,006 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-17 02:45:20,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-17 02:45:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:20,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 02:45:20,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:20,364 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-17 02:45:20,478 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-17 02:45:20,490 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-17 02:45:20,491 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-17 02:45:20,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:20,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:20,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632781890] [2024-11-17 02:45:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632781890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:20,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:20,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 02:45:20,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814903777] [2024-11-17 02:45:20,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:20,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:45:20,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:20,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:45:20,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-17 02:45:20,510 INFO L87 Difference]: Start difference. First operand 1883 states and 2490 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 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-17 02:45:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:22,578 INFO L93 Difference]: Finished difference Result 2319 states and 3050 transitions. [2024-11-17 02:45:22,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 02:45:22,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 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 78 [2024-11-17 02:45:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:22,582 INFO L225 Difference]: With dead ends: 2319 [2024-11-17 02:45:22,582 INFO L226 Difference]: Without dead ends: 2319 [2024-11-17 02:45:22,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 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-17 02:45:22,583 INFO L432 NwaCegarLoop]: 738 mSDtfsCounter, 792 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1581 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:22,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 2284 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1934 Invalid, 0 Unknown, 1581 Unchecked, 2.0s Time] [2024-11-17 02:45:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2024-11-17 02:45:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 1882. [2024-11-17 02:45:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1347 states have (on average 1.7928730512249442) internal successors, (2415), 1840 states have internal predecessors, (2415), 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-17 02:45:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2488 transitions. [2024-11-17 02:45:22,604 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2488 transitions. Word has length 78 [2024-11-17 02:45:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:22,605 INFO L471 AbstractCegarLoop]: Abstraction has 1882 states and 2488 transitions. [2024-11-17 02:45:22,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 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-17 02:45:22,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2488 transitions. [2024-11-17 02:45:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 02:45:22,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:22,605 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] [2024-11-17 02:45:22,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-17 02:45:22,806 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-17 02:45:22,806 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:22,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:22,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1635836252, now seen corresponding path program 1 times [2024-11-17 02:45:22,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:22,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890977204] [2024-11-17 02:45:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:22,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:22,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:22,810 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-17 02:45:22,811 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-17 02:45:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:23,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 02:45:23,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:23,251 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-17 02:45:23,254 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-17 02:45:23,583 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-17 02:45:23,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:45:23,595 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-17 02:45:23,603 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:45:23,611 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-17 02:45:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:23,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:23,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:23,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890977204] [2024-11-17 02:45:23,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890977204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:23,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:23,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:45:23,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894760008] [2024-11-17 02:45:23,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:23,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:45:23,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:23,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:45:23,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-17 02:45:23,627 INFO L87 Difference]: Start difference. First operand 1882 states and 2488 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-17 02:45:27,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:27,982 INFO L93 Difference]: Finished difference Result 3022 states and 3986 transitions. [2024-11-17 02:45:27,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 02:45:27,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 78 [2024-11-17 02:45:27,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:27,987 INFO L225 Difference]: With dead ends: 3022 [2024-11-17 02:45:27,987 INFO L226 Difference]: Without dead ends: 3022 [2024-11-17 02:45:27,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 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-17 02:45:27,992 INFO L432 NwaCegarLoop]: 1248 mSDtfsCounter, 975 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 4127 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 6233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2079 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:27,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 3304 Invalid, 6233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4127 Invalid, 0 Unknown, 2079 Unchecked, 4.3s Time] [2024-11-17 02:45:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2024-11-17 02:45:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 1874. [2024-11-17 02:45:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1347 states have (on average 1.7809948032665182) internal successors, (2399), 1832 states have internal predecessors, (2399), 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-17 02:45:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2472 transitions. [2024-11-17 02:45:28,032 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2472 transitions. Word has length 78 [2024-11-17 02:45:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:28,032 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 2472 transitions. [2024-11-17 02:45:28,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-17 02:45:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2472 transitions. [2024-11-17 02:45:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-17 02:45:28,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:28,033 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] [2024-11-17 02:45:28,045 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-17 02:45:28,233 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-17 02:45:28,234 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:28,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash -276349187, now seen corresponding path program 1 times [2024-11-17 02:45:28,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:28,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606229842] [2024-11-17 02:45:28,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:28,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:28,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:28,237 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-17 02:45:28,239 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-17 02:45:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:28,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 02:45:28,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:28,563 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-17 02:45:28,576 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-17 02:45:28,616 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-17 02:45:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:28,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:28,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:28,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606229842] [2024-11-17 02:45:28,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606229842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:28,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:28,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 02:45:28,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772485601] [2024-11-17 02:45:28,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:28,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 02:45:28,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:28,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 02:45:28,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 02:45:28,645 INFO L87 Difference]: Start difference. First operand 1874 states and 2472 transitions. Second operand has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-17 02:45:31,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:31,553 INFO L93 Difference]: Finished difference Result 1891 states and 2490 transitions. [2024-11-17 02:45:31,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:45:31,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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 85 [2024-11-17 02:45:31,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:31,557 INFO L225 Difference]: With dead ends: 1891 [2024-11-17 02:45:31,557 INFO L226 Difference]: Without dead ends: 1891 [2024-11-17 02:45:31,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 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-17 02:45:31,558 INFO L432 NwaCegarLoop]: 1161 mSDtfsCounter, 19 mSDsluCounter, 3888 mSDsCounter, 0 mSdLazyCounter, 3139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5049 SdHoareTripleChecker+Invalid, 3141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:31,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 5049 Invalid, 3141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3139 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-17 02:45:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2024-11-17 02:45:31,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1890. [2024-11-17 02:45:31,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1361 states have (on average 1.7759000734753858) internal successors, (2417), 1846 states have internal predecessors, (2417), 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-17 02:45:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2490 transitions. [2024-11-17 02:45:31,602 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2490 transitions. Word has length 85 [2024-11-17 02:45:31,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:31,602 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2490 transitions. [2024-11-17 02:45:31,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-17 02:45:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2490 transitions. [2024-11-17 02:45:31,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-17 02:45:31,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:31,604 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] [2024-11-17 02:45:31,615 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-17 02:45:31,807 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-17 02:45:31,808 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:31,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:31,808 INFO L85 PathProgramCache]: Analyzing trace with hash 23109801, now seen corresponding path program 1 times [2024-11-17 02:45:31,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:31,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001262856] [2024-11-17 02:45:31,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:31,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:31,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:31,814 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-17 02:45:31,817 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-17 02:45:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:32,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 02:45:32,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:32,172 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-17 02:45:32,244 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-17 02:45:32,253 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-17 02:45:32,298 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-17 02:45:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:32,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:32,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:32,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001262856] [2024-11-17 02:45:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001262856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:32,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 02:45:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89525778] [2024-11-17 02:45:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:32,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 02:45:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:32,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 02:45:32,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 02:45:32,362 INFO L87 Difference]: Start difference. First operand 1890 states and 2490 transitions. Second operand has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-17 02:45:36,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:36,272 INFO L93 Difference]: Finished difference Result 1890 states and 2488 transitions. [2024-11-17 02:45:36,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:45:36,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 86 [2024-11-17 02:45:36,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:36,275 INFO L225 Difference]: With dead ends: 1890 [2024-11-17 02:45:36,275 INFO L226 Difference]: Without dead ends: 1890 [2024-11-17 02:45:36,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 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-17 02:45:36,277 INFO L432 NwaCegarLoop]: 1157 mSDtfsCounter, 15 mSDsluCounter, 4913 mSDsCounter, 0 mSdLazyCounter, 3287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6070 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:36,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6070 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3287 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-17 02:45:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2024-11-17 02:45:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1890. [2024-11-17 02:45:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1361 states have (on average 1.7744305657604702) internal successors, (2415), 1846 states have internal predecessors, (2415), 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-17 02:45:36,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2488 transitions. [2024-11-17 02:45:36,295 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2488 transitions. Word has length 86 [2024-11-17 02:45:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:36,295 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2488 transitions. [2024-11-17 02:45:36,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-17 02:45:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2488 transitions. [2024-11-17 02:45:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-17 02:45:36,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:36,296 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, 1, 1, 1, 1] [2024-11-17 02:45:36,304 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 (22)] Forceful destruction successful, exit code 0 [2024-11-17 02:45:36,499 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-17 02:45:36,500 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:36,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash 698278914, now seen corresponding path program 1 times [2024-11-17 02:45:36,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:36,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447983288] [2024-11-17 02:45:36,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:36,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:36,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:36,504 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-17 02:45:36,505 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-17 02:45:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:36,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:45:36,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:45:36,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:45:36,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:36,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447983288] [2024-11-17 02:45:36,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447983288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:36,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:36,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 02:45:36,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172126831] [2024-11-17 02:45:36,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:36,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:45:36,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:36,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:45:36,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:45:36,800 INFO L87 Difference]: Start difference. First operand 1890 states and 2488 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-17 02:45:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:36,839 INFO L93 Difference]: Finished difference Result 1906 states and 2506 transitions. [2024-11-17 02:45:36,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:45:36,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 94 [2024-11-17 02:45:36,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:36,844 INFO L225 Difference]: With dead ends: 1906 [2024-11-17 02:45:36,844 INFO L226 Difference]: Without dead ends: 1900 [2024-11-17 02:45:36,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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-17 02:45:36,845 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 3 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3489 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:36,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3489 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:45:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2024-11-17 02:45:36,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1900. [2024-11-17 02:45:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1369 states have (on average 1.7713659605551497) internal successors, (2425), 1856 states have internal predecessors, (2425), 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-17 02:45:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2500 transitions. [2024-11-17 02:45:36,859 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2500 transitions. Word has length 94 [2024-11-17 02:45:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:36,859 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 2500 transitions. [2024-11-17 02:45:36,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-17 02:45:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2500 transitions. [2024-11-17 02:45:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 02:45:36,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:36,860 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, 1, 1, 1, 1, 1] [2024-11-17 02:45:36,869 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-17 02:45:37,060 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-17 02:45:37,061 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:37,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:37,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1391207657, now seen corresponding path program 1 times [2024-11-17 02:45:37,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:37,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481588796] [2024-11-17 02:45:37,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:37,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:37,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:37,064 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-17 02:45:37,065 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-17 02:45:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:37,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:45:37,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:37,404 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-17 02:45:37,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:45:37,484 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-17 02:45:37,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:37,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481588796] [2024-11-17 02:45:37,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481588796] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:45:37,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:45:37,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-17 02:45:37,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529133138] [2024-11-17 02:45:37,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:45:37,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 02:45:37,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:37,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 02:45:37,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-17 02:45:37,486 INFO L87 Difference]: Start difference. First operand 1900 states and 2500 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 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-17 02:45:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:37,643 INFO L93 Difference]: Finished difference Result 1926 states and 2530 transitions. [2024-11-17 02:45:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 02:45:37,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 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 95 [2024-11-17 02:45:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:37,646 INFO L225 Difference]: With dead ends: 1926 [2024-11-17 02:45:37,646 INFO L226 Difference]: Without dead ends: 1914 [2024-11-17 02:45:37,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 180 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-17 02:45:37,647 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 19 mSDsluCounter, 5804 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6970 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:37,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6970 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:45:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2024-11-17 02:45:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1908. [2024-11-17 02:45:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1377 states have (on average 1.768336964415396) internal successors, (2435), 1864 states have internal predecessors, (2435), 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-17 02:45:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2510 transitions. [2024-11-17 02:45:37,661 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2510 transitions. Word has length 95 [2024-11-17 02:45:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:37,662 INFO L471 AbstractCegarLoop]: Abstraction has 1908 states and 2510 transitions. [2024-11-17 02:45:37,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 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-17 02:45:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2510 transitions. [2024-11-17 02:45:37,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 02:45:37,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:37,663 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, 1, 1, 1, 1, 1] [2024-11-17 02:45:37,671 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-17 02:45:37,863 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-17 02:45:37,864 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:37,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:37,864 INFO L85 PathProgramCache]: Analyzing trace with hash -626097854, now seen corresponding path program 2 times [2024-11-17 02:45:37,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:37,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454765549] [2024-11-17 02:45:37,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 02:45:37,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:37,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:37,867 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-17 02:45:37,868 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-17 02:45:38,460 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 02:45:38,461 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:45:38,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 02:45:38,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:38,540 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-17 02:45:38,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:45:38,707 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-17 02:45:38,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:38,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454765549] [2024-11-17 02:45:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454765549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:45:38,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:45:38,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-17 02:45:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280486868] [2024-11-17 02:45:38,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:45:38,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 02:45:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 02:45:38,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-17 02:45:38,710 INFO L87 Difference]: Start difference. First operand 1908 states and 2510 transitions. Second operand has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 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-17 02:45:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:39,134 INFO L93 Difference]: Finished difference Result 1944 states and 2560 transitions. [2024-11-17 02:45:39,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 02:45:39,134 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 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 98 [2024-11-17 02:45:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:39,137 INFO L225 Difference]: With dead ends: 1944 [2024-11-17 02:45:39,137 INFO L226 Difference]: Without dead ends: 1932 [2024-11-17 02:45:39,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-17 02:45:39,138 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 29 mSDsluCounter, 10442 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 11608 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:39,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 11608 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:45:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2024-11-17 02:45:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1926. [2024-11-17 02:45:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1395 states have (on average 1.7627240143369176) internal successors, (2459), 1882 states have internal predecessors, (2459), 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-17 02:45:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2534 transitions. [2024-11-17 02:45:39,153 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2534 transitions. Word has length 98 [2024-11-17 02:45:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:39,153 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 2534 transitions. [2024-11-17 02:45:39,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 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-17 02:45:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2534 transitions. [2024-11-17 02:45:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-17 02:45:39,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:39,154 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, 1, 1, 1, 1, 1] [2024-11-17 02:45:39,167 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 (25)] Forceful destruction successful, exit code 0 [2024-11-17 02:45:39,354 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-17 02:45:39,355 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:39,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:39,355 INFO L85 PathProgramCache]: Analyzing trace with hash 428851490, now seen corresponding path program 3 times [2024-11-17 02:45:39,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:39,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650429157] [2024-11-17 02:45:39,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 02:45:39,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:39,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:39,359 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-17 02:45:39,360 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-17 02:45:40,255 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-17 02:45:40,255 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:45:40,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 02:45:40,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:40,444 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-17 02:45:40,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:45:40,939 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-17 02:45:40,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650429157] [2024-11-17 02:45:40,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650429157] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:45:40,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:45:40,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-17 02:45:40,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969904385] [2024-11-17 02:45:40,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:45:40,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-17 02:45:40,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:40,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-17 02:45:40,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-11-17 02:45:40,941 INFO L87 Difference]: Start difference. First operand 1926 states and 2534 transitions. Second operand has 28 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 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-17 02:45:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:42,601 INFO L93 Difference]: Finished difference Result 1980 states and 2618 transitions. [2024-11-17 02:45:42,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-17 02:45:42,602 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 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 104 [2024-11-17 02:45:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:42,604 INFO L225 Difference]: With dead ends: 1980 [2024-11-17 02:45:42,604 INFO L226 Difference]: Without dead ends: 1962 [2024-11-17 02:45:42,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-11-17 02:45:42,605 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 60 mSDsluCounter, 16255 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 17421 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:42,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 17421 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:45:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-11-17 02:45:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2024-11-17 02:45:42,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1431 states have (on average 1.750524109014675) internal successors, (2505), 1918 states have internal predecessors, (2505), 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-17 02:45:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2580 transitions. [2024-11-17 02:45:42,620 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2580 transitions. Word has length 104 [2024-11-17 02:45:42,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:42,621 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2580 transitions. [2024-11-17 02:45:42,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 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-17 02:45:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2580 transitions. [2024-11-17 02:45:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-17 02:45:42,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:42,622 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, 1, 1, 1, 1, 1] [2024-11-17 02:45:42,633 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 (26)] Forceful destruction successful, exit code 0 [2024-11-17 02:45:42,822 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-17 02:45:42,822 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:42,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:42,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1000732446, now seen corresponding path program 4 times [2024-11-17 02:45:42,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:42,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808457295] [2024-11-17 02:45:42,823 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 02:45:42,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:42,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:42,826 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-17 02:45:42,828 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-17 02:45:43,498 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 02:45:43,499 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:45:43,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 02:45:43,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:43,961 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-17 02:45:43,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:45:45,225 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-17 02:45:45,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:45,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808457295] [2024-11-17 02:45:45,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808457295] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:45:45,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:45:45,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-17 02:45:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520324599] [2024-11-17 02:45:45,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:45:45,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-17 02:45:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:45:45,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-17 02:45:45,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2024-11-17 02:45:45,228 INFO L87 Difference]: Start difference. First operand 1962 states and 2580 transitions. Second operand has 52 states, 52 states have (on average 2.673076923076923) internal successors, (139), 52 states have internal predecessors, (139), 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-17 02:45:52,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:52,758 INFO L93 Difference]: Finished difference Result 2048 states and 2730 transitions. [2024-11-17 02:45:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-17 02:45:52,760 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.673076923076923) internal successors, (139), 52 states have internal predecessors, (139), 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 116 [2024-11-17 02:45:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:52,762 INFO L225 Difference]: With dead ends: 2048 [2024-11-17 02:45:52,762 INFO L226 Difference]: Without dead ends: 2036 [2024-11-17 02:45:52,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2024-11-17 02:45:52,768 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 151 mSDsluCounter, 27879 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 29045 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:52,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 29045 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:45:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2024-11-17 02:45:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 2030. [2024-11-17 02:45:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 1499 states have (on average 1.732488325550367) internal successors, (2597), 1986 states have internal predecessors, (2597), 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-17 02:45:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2672 transitions. [2024-11-17 02:45:52,790 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2672 transitions. Word has length 116 [2024-11-17 02:45:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:52,791 INFO L471 AbstractCegarLoop]: Abstraction has 2030 states and 2672 transitions. [2024-11-17 02:45:52,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.673076923076923) internal successors, (139), 52 states have internal predecessors, (139), 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-17 02:45:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2672 transitions. [2024-11-17 02:45:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-17 02:45:52,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:52,792 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, 1, 1, 1, 1, 1] [2024-11-17 02:45:52,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-17 02:45:52,996 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-17 02:45:52,997 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:45:52,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1245166142, now seen corresponding path program 5 times [2024-11-17 02:45:52,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:45:52,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936490213] [2024-11-17 02:45:52,998 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 02:45:52,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:45:52,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:45:53,000 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-17 02:45:53,001 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-17 02:45:54,348 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-17 02:45:54,348 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:45:54,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-17 02:45:54,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:45:54,405 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-17 02:45:54,557 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-17 02:45:54,557 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-17 02:45:54,584 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-17 02:45:54,685 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-17 02:45:55,812 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:45:55,813 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-17 02:45:55,846 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-17 02:45:55,880 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-17 02:45:55,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:45:56,186 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2666 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem71#1.base| v_ArrVal_2666) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-17 02:45:56,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:45:56,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936490213] [2024-11-17 02:45:56,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936490213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:45:56,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1779338798] [2024-11-17 02:45:56,188 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 02:45:56,188 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 02:45:56,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 02:45:56,190 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-17 02:45:56,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process