./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:53:37,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:53:37,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:53:37,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:53:37,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:53:37,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:53:37,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:53:37,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:53:37,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:53:37,188 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:53:37,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:53:37,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:53:37,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:53:37,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:53:37,192 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:53:37,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:53:37,193 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:53:37,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:53:37,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:53:37,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:53:37,194 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:53:37,198 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:53:37,198 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:53:37,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:53:37,198 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:53:37,199 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:53:37,199 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:53:37,199 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:53:37,199 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:53:37,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:53:37,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:53:37,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:53:37,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:53:37,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:53:37,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:53:37,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:53:37,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:53:37,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:53:37,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:53:37,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:53:37,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:53:37,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:53:37,202 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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2024-10-13 11:53:37,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:53:37,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:53:37,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:53:37,494 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:53:37,495 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:53:37,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-10-13 11:53:39,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:53:39,371 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:53:39,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-10-13 11:53:39,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/120d2a5cf/ce293fd0dddc40bbb54c5dcd8c406b4d/FLAGb71af1aaf [2024-10-13 11:53:39,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/120d2a5cf/ce293fd0dddc40bbb54c5dcd8c406b4d [2024-10-13 11:53:39,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:53:39,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:53:39,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:53:39,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:53:39,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:53:39,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:53:39" (1/1) ... [2024-10-13 11:53:39,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b7148f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39, skipping insertion in model container [2024-10-13 11:53:39,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:53:39" (1/1) ... [2024-10-13 11:53:39,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:53:40,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:53:40,470 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 11:53:40,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@429dc4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:40, skipping insertion in model container [2024-10-13 11:53:40,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:53:40,475 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:53:40,477 INFO L158 Benchmark]: Toolchain (without parser) took 878.17ms. Allocated memory is still 165.7MB. Free memory was 94.4MB in the beginning and 121.1MB in the end (delta: -26.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 11:53:40,477 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 113.2MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:53:40,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 875.94ms. Allocated memory is still 165.7MB. Free memory was 94.2MB in the beginning and 121.1MB in the end (delta: -26.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 11:53:40,485 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.26ms. Allocated memory is still 113.2MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 875.94ms. Allocated memory is still 165.7MB. Free memory was 94.2MB in the beginning and 121.1MB in the end (delta: -26.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:53:42,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:53:42,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 11:53:42,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:53:42,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:53:42,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:53:42,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:53:42,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:53:42,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:53:42,738 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:53:42,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:53:42,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:53:42,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:53:42,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:53:42,742 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:53:42,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:53:42,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:53:42,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:53:42,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:53:42,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:53:42,747 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:53:42,747 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:53:42,747 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:53:42,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:53:42,748 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:53:42,748 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:53:42,748 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:53:42,749 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:53:42,749 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:53:42,749 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:53:42,749 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:53:42,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:53:42,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:53:42,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:53:42,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:53:42,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:53:42,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:53:42,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:53:42,756 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:53:42,756 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:53:42,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:53:42,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:53:42,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:53:42,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:53:42,757 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:53:42,758 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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2024-10-13 11:53:43,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:53:43,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:53:43,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:53:43,135 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:53:43,135 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:53:43,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-10-13 11:53:44,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:53:45,000 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:53:45,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-10-13 11:53:45,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b0f84a6/3829ee94b1b947cd86a5117297e55724/FLAGce428d313 [2024-10-13 11:53:45,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b0f84a6/3829ee94b1b947cd86a5117297e55724 [2024-10-13 11:53:45,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:53:45,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:53:45,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:53:45,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:53:45,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:53:45,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:53:45" (1/1) ... [2024-10-13 11:53:45,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ec1804c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:45, skipping insertion in model container [2024-10-13 11:53:45,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:53:45" (1/1) ... [2024-10-13 11:53:45,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:53:46,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:53:46,098 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:53:46,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:53:46,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:53:46,218 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:53:46,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:53:46,389 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:53:46,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46 WrapperNode [2024-10-13 11:53:46,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:53:46,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:53:46,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:53:46,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:53:46,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46" (1/1) ... [2024-10-13 11:53:46,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46" (1/1) ... [2024-10-13 11:53:46,527 INFO L138 Inliner]: procedures = 285, calls = 290, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1069 [2024-10-13 11:53:46,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:53:46,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:53:46,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:53:46,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:53:46,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46" (1/1) ... [2024-10-13 11:53:46,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46" (1/1) ... [2024-10-13 11:53:46,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46" (1/1) ... [2024-10-13 11:53:46,665 INFO L175 MemorySlicer]: Split 259 memory accesses to 4 slices as follows [2, 3, 220, 34]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 2, 49, 4]. [2024-10-13 11:53:46,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46" (1/1) ... [2024-10-13 11:53:46,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46" (1/1) ... [2024-10-13 11:53:46,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46" (1/1) ... [2024-10-13 11:53:46,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46" (1/1) ... [2024-10-13 11:53:46,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46" (1/1) ... [2024-10-13 11:53:46,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46" (1/1) ... [2024-10-13 11:53:46,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:53:46,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:53:46,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:53:46,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:53:46,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46" (1/1) ... [2024-10-13 11:53:46,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:53:46,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:53:46,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 11:53:46,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 11:53:46,841 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 11:53:46,841 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 11:53:46,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:53:46,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:53:46,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 11:53:46,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 11:53:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:53:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:53:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 11:53:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-13 11:53:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:53:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:53:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:53:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:53:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 11:53:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:53:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:53:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:53:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 11:53:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-13 11:53:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:53:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:53:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 11:53:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 11:53:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-13 11:53:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-13 11:53:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 11:53:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 11:53:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:53:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:53:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-13 11:53:46,844 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-13 11:53:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:53:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:53:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:53:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 11:53:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-13 11:53:46,846 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-13 11:53:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:53:46,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:53:47,131 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:53:47,133 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:53:51,220 INFO L? ?]: Removed 1086 outVars from TransFormulas that were not future-live. [2024-10-13 11:53:51,220 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:53:51,387 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:53:51,390 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-13 11:53:51,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:53:51 BoogieIcfgContainer [2024-10-13 11:53:51,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:53:51,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:53:51,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:53:51,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:53:51,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:53:45" (1/3) ... [2024-10-13 11:53:51,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cb26a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:53:51, skipping insertion in model container [2024-10-13 11:53:51,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:46" (2/3) ... [2024-10-13 11:53:51,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cb26a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:53:51, skipping insertion in model container [2024-10-13 11:53:51,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:53:51" (3/3) ... [2024-10-13 11:53:51,401 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-1.i [2024-10-13 11:53:51,420 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:53:51,420 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 522 error locations. [2024-10-13 11:53:51,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:53:51,497 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;@1a69ae6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:53:51,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 522 error locations. [2024-10-13 11:53:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 977 states, 432 states have (on average 2.497685185185185) internal successors, (1079), 957 states have internal predecessors, (1079), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 11:53:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:53:51,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:53:51,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:53:51,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:53:51,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:53:51,516 INFO L85 PathProgramCache]: Analyzing trace with hash 55116, now seen corresponding path program 1 times [2024-10-13 11:53:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:53:51,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071890701] [2024-10-13 11:53:51,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:53:51,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:51,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:53:51,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:53:51,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 (2)] Waiting until timeout for monitored process [2024-10-13 11:53:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:53:51,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:53:51,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:53:51,742 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-10-13 11:53:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:53:51,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:53:51,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:53:51,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071890701] [2024-10-13 11:53:51,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071890701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:53:51,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:53:51,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:53:51,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882224049] [2024-10-13 11:53:51,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:53:51,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:53:51,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:53:51,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:53:51,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:53:51,846 INFO L87 Difference]: Start difference. First operand has 977 states, 432 states have (on average 2.497685185185185) internal successors, (1079), 957 states have internal predecessors, (1079), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:53:53,868 INFO L93 Difference]: Finished difference Result 1048 states and 1118 transitions. [2024-10-13 11:53:53,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:53:53,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-13 11:53:53,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:53:53,887 INFO L225 Difference]: With dead ends: 1048 [2024-10-13 11:53:53,887 INFO L226 Difference]: Without dead ends: 1047 [2024-10-13 11:53:53,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-13 11:53:53,892 INFO L432 NwaCegarLoop]: 654 mSDtfsCounter, 649 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:53:53,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 854 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 11:53:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-10-13 11:53:53,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 990. [2024-10-13 11:53:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 460 states have (on average 2.3239130434782607) internal successors, (1069), 972 states have internal predecessors, (1069), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 11:53:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1099 transitions. [2024-10-13 11:53:53,980 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1099 transitions. Word has length 2 [2024-10-13 11:53:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:53:53,981 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1099 transitions. [2024-10-13 11:53:53,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1099 transitions. [2024-10-13 11:53:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:53:53,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:53:53,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:53:53,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 11:53:54,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:54,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:53:54,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:53:54,184 INFO L85 PathProgramCache]: Analyzing trace with hash 55117, now seen corresponding path program 1 times [2024-10-13 11:53:54,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:53:54,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869484483] [2024-10-13 11:53:54,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:53:54,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:54,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:53:54,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:53:54,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 11:53:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:53:54,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:53:54,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:53:54,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:53:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:53:54,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:53:54,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:53:54,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869484483] [2024-10-13 11:53:54,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869484483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:53:54,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:53:54,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:53:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379565893] [2024-10-13 11:53:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:53:54,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:53:54,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:53:54,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:53:54,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:53:54,360 INFO L87 Difference]: Start difference. First operand 990 states and 1099 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:56,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:53:56,804 INFO L93 Difference]: Finished difference Result 1355 states and 1501 transitions. [2024-10-13 11:53:56,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:53:56,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-13 11:53:56,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:53:56,810 INFO L225 Difference]: With dead ends: 1355 [2024-10-13 11:53:56,810 INFO L226 Difference]: Without dead ends: 1355 [2024-10-13 11:53:56,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-13 11:53:56,812 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 389 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:53:56,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1260 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 11:53:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2024-10-13 11:53:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1164. [2024-10-13 11:53:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 633 states have (on average 2.2985781990521326) internal successors, (1455), 1144 states have internal predecessors, (1455), 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-10-13 11:53:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1489 transitions. [2024-10-13 11:53:56,849 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1489 transitions. Word has length 2 [2024-10-13 11:53:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:53:56,849 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1489 transitions. [2024-10-13 11:53:56,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1489 transitions. [2024-10-13 11:53:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:53:56,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:53:56,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:53:56,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 11:53:57,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:57,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:53:57,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:53:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash -636050060, now seen corresponding path program 1 times [2024-10-13 11:53:57,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:53:57,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524861542] [2024-10-13 11:53:57,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:53:57,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:57,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:53:57,057 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:53:57,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 11:53:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:53:57,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:53:57,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:53:57,221 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-10-13 11:53:57,229 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-10-13 11:53:57,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:53:57,311 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-10-13 11:53:57,332 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:53:57,333 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-10-13 11:53:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:53:57,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:53:57,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:53:57,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524861542] [2024-10-13 11:53:57,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524861542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:53:57,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:53:57,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:53:57,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337730991] [2024-10-13 11:53:57,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:53:57,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:53:57,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:53:57,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:53:57,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:53:57,361 INFO L87 Difference]: Start difference. First operand 1164 states and 1489 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:01,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:01,032 INFO L93 Difference]: Finished difference Result 1798 states and 2181 transitions. [2024-10-13 11:54:01,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:54:01,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-10-13 11:54:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:01,040 INFO L225 Difference]: With dead ends: 1798 [2024-10-13 11:54:01,040 INFO L226 Difference]: Without dead ends: 1798 [2024-10-13 11:54:01,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-13 11:54:01,042 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 662 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:01,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 1235 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 11:54:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2024-10-13 11:54:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1280. [2024-10-13 11:54:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 749 states have (on average 2.281708945260347) internal successors, (1709), 1260 states have internal predecessors, (1709), 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-10-13 11:54:01,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1743 transitions. [2024-10-13 11:54:01,074 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1743 transitions. Word has length 6 [2024-10-13 11:54:01,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:01,075 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1743 transitions. [2024-10-13 11:54:01,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:01,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1743 transitions. [2024-10-13 11:54:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:54:01,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:01,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:01,081 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-10-13 11:54:01,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:01,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:01,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:01,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1757284643, now seen corresponding path program 1 times [2024-10-13 11:54:01,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:01,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131247277] [2024-10-13 11:54:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:01,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:01,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:01,282 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:01,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 11:54:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:01,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:54:01,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:01,422 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-10-13 11:54:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:01,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:01,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:01,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131247277] [2024-10-13 11:54:01,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131247277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:01,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:01,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:54:01,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618070347] [2024-10-13 11:54:01,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:01,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:54:01,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:01,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:54:01,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:54:01,436 INFO L87 Difference]: Start difference. First operand 1280 states and 1743 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:03,397 INFO L93 Difference]: Finished difference Result 1754 states and 2445 transitions. [2024-10-13 11:54:03,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:54:03,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-10-13 11:54:03,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:03,403 INFO L225 Difference]: With dead ends: 1754 [2024-10-13 11:54:03,404 INFO L226 Difference]: Without dead ends: 1754 [2024-10-13 11:54:03,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-13 11:54:03,408 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 830 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:03,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1066 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 11:54:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2024-10-13 11:54:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1235. [2024-10-13 11:54:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 749 states have (on average 2.202937249666222) internal successors, (1650), 1215 states have internal predecessors, (1650), 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-10-13 11:54:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1684 transitions. [2024-10-13 11:54:03,444 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1684 transitions. Word has length 7 [2024-10-13 11:54:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:03,446 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1684 transitions. [2024-10-13 11:54:03,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1684 transitions. [2024-10-13 11:54:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:54:03,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:03,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:03,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 11:54:03,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:03,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:03,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1757284644, now seen corresponding path program 1 times [2024-10-13 11:54:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:03,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720628045] [2024-10-13 11:54:03,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:03,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:03,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:03,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:03,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 11:54:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:03,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:54:03,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:03,820 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-10-13 11:54:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:03,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:03,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:03,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720628045] [2024-10-13 11:54:03,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720628045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:03,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:03,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:54:03,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469877897] [2024-10-13 11:54:03,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:03,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:54:03,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:03,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:54:03,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:54:03,850 INFO L87 Difference]: Start difference. First operand 1235 states and 1684 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:05,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:05,978 INFO L93 Difference]: Finished difference Result 1809 states and 2458 transitions. [2024-10-13 11:54:05,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:54:05,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-10-13 11:54:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:05,984 INFO L225 Difference]: With dead ends: 1809 [2024-10-13 11:54:05,985 INFO L226 Difference]: Without dead ends: 1809 [2024-10-13 11:54:05,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-13 11:54:05,987 INFO L432 NwaCegarLoop]: 973 mSDtfsCounter, 633 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:05,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1338 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 11:54:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-10-13 11:54:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1227. [2024-10-13 11:54:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 751 states have (on average 2.1677762982689748) internal successors, (1628), 1207 states have internal predecessors, (1628), 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-10-13 11:54:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1662 transitions. [2024-10-13 11:54:06,021 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1662 transitions. Word has length 7 [2024-10-13 11:54:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:06,022 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1662 transitions. [2024-10-13 11:54:06,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1662 transitions. [2024-10-13 11:54:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:54:06,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:06,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:06,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 11:54:06,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:06,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:06,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2143508545, now seen corresponding path program 1 times [2024-10-13 11:54:06,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:06,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434260732] [2024-10-13 11:54:06,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:06,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:06,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:06,226 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:06,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 11:54:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:06,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:54:06,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:06,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:06,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:06,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:06,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434260732] [2024-10-13 11:54:06,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434260732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:06,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:06,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:54:06,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990273795] [2024-10-13 11:54:06,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:06,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:54:06,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:06,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:54:06,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:06,428 INFO L87 Difference]: Start difference. First operand 1227 states and 1662 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:07,814 INFO L93 Difference]: Finished difference Result 1627 states and 2172 transitions. [2024-10-13 11:54:07,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:54:07,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-10-13 11:54:07,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:07,820 INFO L225 Difference]: With dead ends: 1627 [2024-10-13 11:54:07,821 INFO L226 Difference]: Without dead ends: 1627 [2024-10-13 11:54:07,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:07,821 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 406 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:07,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 2525 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 11:54:07,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-10-13 11:54:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1437. [2024-10-13 11:54:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 961 states have (on average 2.1800208116545265) internal successors, (2095), 1417 states have internal predecessors, (2095), 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-10-13 11:54:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2129 transitions. [2024-10-13 11:54:07,855 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2129 transitions. Word has length 12 [2024-10-13 11:54:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:07,856 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2129 transitions. [2024-10-13 11:54:07,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:07,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2129 transitions. [2024-10-13 11:54:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:54:07,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:07,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:07,862 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-10-13 11:54:08,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:08,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:08,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:08,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1554900703, now seen corresponding path program 1 times [2024-10-13 11:54:08,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:08,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507138536] [2024-10-13 11:54:08,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:08,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:08,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:08,064 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:08,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 (8)] Waiting until timeout for monitored process [2024-10-13 11:54:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:08,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:54:08,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:08,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-10-13 11:54:08,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:08,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:08,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507138536] [2024-10-13 11:54:08,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507138536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:08,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:08,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:54:08,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564264266] [2024-10-13 11:54:08,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:08,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:54:08,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:08,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:54:08,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:54:08,228 INFO L87 Difference]: Start difference. First operand 1437 states and 2129 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:08,751 INFO L93 Difference]: Finished difference Result 1353 states and 1969 transitions. [2024-10-13 11:54:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:54:08,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-10-13 11:54:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:08,757 INFO L225 Difference]: With dead ends: 1353 [2024-10-13 11:54:08,757 INFO L226 Difference]: Without dead ends: 1353 [2024-10-13 11:54:08,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-10-13 11:54:08,758 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 61 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:08,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1582 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:54:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-10-13 11:54:08,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2024-10-13 11:54:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 901 states have (on average 2.1476137624861265) internal successors, (1935), 1333 states have internal predecessors, (1935), 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-10-13 11:54:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1969 transitions. [2024-10-13 11:54:08,789 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1969 transitions. Word has length 12 [2024-10-13 11:54:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:08,789 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1969 transitions. [2024-10-13 11:54:08,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1969 transitions. [2024-10-13 11:54:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 11:54:08,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:08,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:08,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 11:54:08,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:08,992 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:08,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:08,992 INFO L85 PathProgramCache]: Analyzing trace with hash 201952929, now seen corresponding path program 1 times [2024-10-13 11:54:08,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:08,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766078799] [2024-10-13 11:54:08,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:08,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:08,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:08,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:08,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 11:54:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:09,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:54:09,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:09,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:54:09,171 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:54:09,171 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:54:09,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 11:54:09,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:54:09,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 11:54:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:09,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:09,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:09,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766078799] [2024-10-13 11:54:09,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766078799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:09,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:09,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:54:09,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531206377] [2024-10-13 11:54:09,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:09,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:54:09,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:09,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:54:09,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:09,244 INFO L87 Difference]: Start difference. First operand 1353 states and 1969 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-13 11:54:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:10,531 INFO L93 Difference]: Finished difference Result 1853 states and 2258 transitions. [2024-10-13 11:54:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:54:10,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2024-10-13 11:54:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:10,537 INFO L225 Difference]: With dead ends: 1853 [2024-10-13 11:54:10,537 INFO L226 Difference]: Without dead ends: 1853 [2024-10-13 11:54:10,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:54:10,537 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 809 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:10,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 2678 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:54:10,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2024-10-13 11:54:10,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1082. [2024-10-13 11:54:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 632 states have (on average 2.1297468354430378) internal successors, (1346), 1064 states have internal predecessors, (1346), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 11:54:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1376 transitions. [2024-10-13 11:54:10,560 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1376 transitions. Word has length 15 [2024-10-13 11:54:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:10,561 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1376 transitions. [2024-10-13 11:54:10,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-13 11:54:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1376 transitions. [2024-10-13 11:54:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 11:54:10,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:10,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:10,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 11:54:10,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:10,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:10,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1507469734, now seen corresponding path program 1 times [2024-10-13 11:54:10,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:10,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352763109] [2024-10-13 11:54:10,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:10,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:10,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:10,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:10,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 11:54:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:10,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:54:10,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:10,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:10,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:10,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352763109] [2024-10-13 11:54:10,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352763109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:10,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:10,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:54:10,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293182401] [2024-10-13 11:54:10,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:10,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:54:10,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:10,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:54:10,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:54:10,948 INFO L87 Difference]: Start difference. First operand 1082 states and 1376 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:11,471 INFO L93 Difference]: Finished difference Result 1028 states and 1296 transitions. [2024-10-13 11:54:11,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:54:11,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2024-10-13 11:54:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:11,475 INFO L225 Difference]: With dead ends: 1028 [2024-10-13 11:54:11,475 INFO L226 Difference]: Without dead ends: 1028 [2024-10-13 11:54:11,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-10-13 11:54:11,476 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 61 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:11,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1508 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:54:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2024-10-13 11:54:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1028. [2024-10-13 11:54:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 602 states have (on average 2.1029900332225915) internal successors, (1266), 1010 states have internal predecessors, (1266), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 11:54:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1296 transitions. [2024-10-13 11:54:11,493 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1296 transitions. Word has length 15 [2024-10-13 11:54:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:11,494 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1296 transitions. [2024-10-13 11:54:11,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1296 transitions. [2024-10-13 11:54:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 11:54:11,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:11,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:11,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 11:54:11,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:11,695 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:11,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1274437676, now seen corresponding path program 1 times [2024-10-13 11:54:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:11,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515274440] [2024-10-13 11:54:11,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:11,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:11,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:11,697 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:11,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 11:54:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:11,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:54:11,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:11,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:11,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:11,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515274440] [2024-10-13 11:54:11,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515274440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:11,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:11,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:54:11,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191981018] [2024-10-13 11:54:11,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:11,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:54:11,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:11,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:54:11,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:11,895 INFO L87 Difference]: Start difference. First operand 1028 states and 1296 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:12,624 INFO L93 Difference]: Finished difference Result 1012 states and 1252 transitions. [2024-10-13 11:54:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:54:12,626 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), 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 17 [2024-10-13 11:54:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:12,629 INFO L225 Difference]: With dead ends: 1012 [2024-10-13 11:54:12,630 INFO L226 Difference]: Without dead ends: 1012 [2024-10-13 11:54:12,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:54:12,631 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 45 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:12,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2214 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:54:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-10-13 11:54:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2024-10-13 11:54:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 600 states have (on average 2.0366666666666666) internal successors, (1222), 994 states have internal predecessors, (1222), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 11:54:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1252 transitions. [2024-10-13 11:54:12,645 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1252 transitions. Word has length 17 [2024-10-13 11:54:12,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:12,646 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1252 transitions. [2024-10-13 11:54:12,646 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1252 transitions. [2024-10-13 11:54:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:54:12,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:12,647 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] [2024-10-13 11:54:12,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 11:54:12,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:12,851 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:12,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:12,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1196089309, now seen corresponding path program 1 times [2024-10-13 11:54:12,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:12,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449879238] [2024-10-13 11:54:12,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:12,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:12,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:12,857 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:12,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 11:54:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:13,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:54:13,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:13,064 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-10-13 11:54:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:13,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:13,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:13,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449879238] [2024-10-13 11:54:13,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449879238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:13,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:13,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:54:13,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407358728] [2024-10-13 11:54:13,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:13,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:54:13,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:13,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:54:13,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:13,255 INFO L87 Difference]: Start difference. First operand 1012 states and 1252 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:15,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:15,609 INFO L93 Difference]: Finished difference Result 1498 states and 1865 transitions. [2024-10-13 11:54:15,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:54:15,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-10-13 11:54:15,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:15,615 INFO L225 Difference]: With dead ends: 1498 [2024-10-13 11:54:15,615 INFO L226 Difference]: Without dead ends: 1498 [2024-10-13 11:54:15,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:54:15,616 INFO L432 NwaCegarLoop]: 951 mSDtfsCounter, 535 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:15,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1900 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 11:54:15,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-10-13 11:54:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1008. [2024-10-13 11:54:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 600 states have (on average 2.0233333333333334) internal successors, (1214), 990 states have internal predecessors, (1214), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 11:54:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1244 transitions. [2024-10-13 11:54:15,631 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1244 transitions. Word has length 31 [2024-10-13 11:54:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:15,631 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1244 transitions. [2024-10-13 11:54:15,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1244 transitions. [2024-10-13 11:54:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:54:15,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:15,633 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] [2024-10-13 11:54:15,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 11:54:15,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:15,837 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:15,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:15,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1196089310, now seen corresponding path program 1 times [2024-10-13 11:54:15,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:15,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935197594] [2024-10-13 11:54:15,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:15,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:15,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:15,841 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:15,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 11:54:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:16,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:54:16,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:16,038 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-10-13 11:54:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:16,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:16,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:16,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935197594] [2024-10-13 11:54:16,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935197594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:16,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:16,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:54:16,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458930987] [2024-10-13 11:54:16,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:16,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:54:16,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:16,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:54:16,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:16,118 INFO L87 Difference]: Start difference. First operand 1008 states and 1244 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:17,792 INFO L93 Difference]: Finished difference Result 1387 states and 1744 transitions. [2024-10-13 11:54:17,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:54:17,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-10-13 11:54:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:17,797 INFO L225 Difference]: With dead ends: 1387 [2024-10-13 11:54:17,797 INFO L226 Difference]: Without dead ends: 1387 [2024-10-13 11:54:17,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:54:17,798 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 728 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:17,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1022 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 11:54:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-10-13 11:54:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1004. [2024-10-13 11:54:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 600 states have (on average 2.01) internal successors, (1206), 986 states have internal predecessors, (1206), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 11:54:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1236 transitions. [2024-10-13 11:54:17,814 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1236 transitions. Word has length 31 [2024-10-13 11:54:17,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:17,814 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1236 transitions. [2024-10-13 11:54:17,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1236 transitions. [2024-10-13 11:54:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 11:54:17,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:17,817 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] [2024-10-13 11:54:17,825 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-10-13 11:54:18,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:18,018 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:18,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:18,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1418610896, now seen corresponding path program 1 times [2024-10-13 11:54:18,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:18,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622132186] [2024-10-13 11:54:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:18,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:18,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:18,022 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:18,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 11:54:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:18,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:54:18,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:18,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:18,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:18,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622132186] [2024-10-13 11:54:18,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622132186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:18,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:18,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:54:18,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362572455] [2024-10-13 11:54:18,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:18,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:54:18,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:18,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:54:18,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:18,297 INFO L87 Difference]: Start difference. First operand 1004 states and 1236 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:19,087 INFO L93 Difference]: Finished difference Result 992 states and 1216 transitions. [2024-10-13 11:54:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:54:19,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 51 [2024-10-13 11:54:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:19,091 INFO L225 Difference]: With dead ends: 992 [2024-10-13 11:54:19,091 INFO L226 Difference]: Without dead ends: 992 [2024-10-13 11:54:19,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:54:19,092 INFO L432 NwaCegarLoop]: 738 mSDtfsCounter, 15 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:19,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2197 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 11:54:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2024-10-13 11:54:19,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2024-10-13 11:54:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 588 states have (on average 2.0170068027210886) internal successors, (1186), 974 states have internal predecessors, (1186), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 11:54:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1216 transitions. [2024-10-13 11:54:19,103 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1216 transitions. Word has length 51 [2024-10-13 11:54:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:19,103 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1216 transitions. [2024-10-13 11:54:19,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1216 transitions. [2024-10-13 11:54:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 11:54:19,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:19,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:19,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-13 11:54:19,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:19,305 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:19,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:19,306 INFO L85 PathProgramCache]: Analyzing trace with hash -711112527, now seen corresponding path program 1 times [2024-10-13 11:54:19,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:19,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793965864] [2024-10-13 11:54:19,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:19,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:19,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:19,308 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:19,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 11:54:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:19,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 11:54:19,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:19,677 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-10-13 11:54:19,678 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-10-13 11:54:19,738 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-13 11:54:19,738 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-10-13 11:54:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:20,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:20,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:20,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793965864] [2024-10-13 11:54:20,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793965864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:20,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:20,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:54:20,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598789577] [2024-10-13 11:54:20,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:20,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:54:20,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:20,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:54:20,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:54:20,381 INFO L87 Difference]: Start difference. First operand 992 states and 1216 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:22,847 INFO L93 Difference]: Finished difference Result 1810 states and 2219 transitions. [2024-10-13 11:54:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:54:22,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-13 11:54:22,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:22,852 INFO L225 Difference]: With dead ends: 1810 [2024-10-13 11:54:22,852 INFO L226 Difference]: Without dead ends: 1810 [2024-10-13 11:54:22,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:54:22,853 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 715 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:22,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1348 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 11:54:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-10-13 11:54:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1344. [2024-10-13 11:54:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 925 states have (on average 2.0086486486486486) internal successors, (1858), 1314 states have internal predecessors, (1858), 29 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:54:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1912 transitions. [2024-10-13 11:54:22,872 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1912 transitions. Word has length 55 [2024-10-13 11:54:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:22,872 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 1912 transitions. [2024-10-13 11:54:22,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1912 transitions. [2024-10-13 11:54:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 11:54:22,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:22,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:22,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 11:54:23,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:23,077 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:23,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash -711112526, now seen corresponding path program 1 times [2024-10-13 11:54:23,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:23,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054667316] [2024-10-13 11:54:23,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:23,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:23,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:23,079 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:23,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 11:54:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:23,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 11:54:23,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:23,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:54:23,475 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-10-13 11:54:23,546 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 11:54:23,546 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-10-13 11:54:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:24,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:24,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054667316] [2024-10-13 11:54:24,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054667316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:24,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:24,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:54:24,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972950499] [2024-10-13 11:54:24,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:24,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:54:24,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:24,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:54:24,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:24,131 INFO L87 Difference]: Start difference. First operand 1344 states and 1912 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:25,920 INFO L93 Difference]: Finished difference Result 1349 states and 1918 transitions. [2024-10-13 11:54:25,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:54:25,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-13 11:54:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:25,925 INFO L225 Difference]: With dead ends: 1349 [2024-10-13 11:54:25,925 INFO L226 Difference]: Without dead ends: 1349 [2024-10-13 11:54:25,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:25,926 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 0 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:25,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1544 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 11:54:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2024-10-13 11:54:25,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2024-10-13 11:54:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 929 states have (on average 2.0043057050592035) internal successors, (1862), 1318 states have internal predecessors, (1862), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 11:54:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1918 transitions. [2024-10-13 11:54:25,944 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1918 transitions. Word has length 55 [2024-10-13 11:54:25,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:25,944 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 1918 transitions. [2024-10-13 11:54:25,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1918 transitions. [2024-10-13 11:54:25,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 11:54:25,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:25,945 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-10-13 11:54:25,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 11:54:26,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:26,146 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:26,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:26,147 INFO L85 PathProgramCache]: Analyzing trace with hash 511752310, now seen corresponding path program 1 times [2024-10-13 11:54:26,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:26,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300327107] [2024-10-13 11:54:26,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:26,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:26,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:26,151 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:26,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 (17)] Waiting until timeout for monitored process [2024-10-13 11:54:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:26,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:54:26,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:26,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:26,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:26,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300327107] [2024-10-13 11:54:26,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300327107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:26,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:26,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:54:26,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048219059] [2024-10-13 11:54:26,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:26,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:54:26,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:26,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:54:26,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:54:26,543 INFO L87 Difference]: Start difference. First operand 1349 states and 1918 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-10-13 11:54:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:27,930 INFO L93 Difference]: Finished difference Result 1353 states and 1926 transitions. [2024-10-13 11:54:27,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:54:27,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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 59 [2024-10-13 11:54:27,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:27,938 INFO L225 Difference]: With dead ends: 1353 [2024-10-13 11:54:27,938 INFO L226 Difference]: Without dead ends: 1353 [2024-10-13 11:54:27,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 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-10-13 11:54:27,939 INFO L432 NwaCegarLoop]: 735 mSDtfsCounter, 19 mSDsluCounter, 2855 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:27,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3590 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 11:54:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-10-13 11:54:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1351. [2024-10-13 11:54:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 930 states have (on average 2.003225806451613) internal successors, (1863), 1319 states have internal predecessors, (1863), 30 states have call successors, (30), 10 states have call predecessors, (30), 8 states have return successors, (29), 22 states have call predecessors, (29), 26 states have call successors, (29) [2024-10-13 11:54:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1922 transitions. [2024-10-13 11:54:27,964 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1922 transitions. Word has length 59 [2024-10-13 11:54:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:27,964 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 1922 transitions. [2024-10-13 11:54:27,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-10-13 11:54:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1922 transitions. [2024-10-13 11:54:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 11:54:27,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:27,966 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] [2024-10-13 11:54:27,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-13 11:54:28,166 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-10-13 11:54:28,166 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:28,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:28,167 INFO L85 PathProgramCache]: Analyzing trace with hash -918850781, now seen corresponding path program 1 times [2024-10-13 11:54:28,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:28,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299653644] [2024-10-13 11:54:28,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:28,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:28,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:28,171 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-10-13 11:54:28,173 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-10-13 11:54:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:28,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:54:28,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:28,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-10-13 11:54:28,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:28,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:28,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299653644] [2024-10-13 11:54:28,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299653644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:28,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:28,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:54:28,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067110199] [2024-10-13 11:54:28,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:28,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:54:28,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:28,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:54:28,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:54:28,508 INFO L87 Difference]: Start difference. First operand 1351 states and 1922 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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-10-13 11:54:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:29,610 INFO L93 Difference]: Finished difference Result 1375 states and 1946 transitions. [2024-10-13 11:54:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:54:29,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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 62 [2024-10-13 11:54:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:29,615 INFO L225 Difference]: With dead ends: 1375 [2024-10-13 11:54:29,615 INFO L226 Difference]: Without dead ends: 1375 [2024-10-13 11:54:29,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 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-10-13 11:54:29,616 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 13 mSDsluCounter, 2993 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3743 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:29,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3743 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:54:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-10-13 11:54:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1371. [2024-10-13 11:54:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 944 states have (on average 1.99364406779661) internal successors, (1882), 1335 states have internal predecessors, (1882), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-10-13 11:54:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1943 transitions. [2024-10-13 11:54:29,646 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1943 transitions. Word has length 62 [2024-10-13 11:54:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:29,646 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1943 transitions. [2024-10-13 11:54:29,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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-10-13 11:54:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1943 transitions. [2024-10-13 11:54:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 11:54:29,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:29,648 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] [2024-10-13 11:54:29,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-13 11:54:29,848 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-10-13 11:54:29,849 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:29,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:29,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1853468852, now seen corresponding path program 1 times [2024-10-13 11:54:29,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:29,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781323139] [2024-10-13 11:54:29,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:29,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:29,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:29,851 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-10-13 11:54:29,853 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-10-13 11:54:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:30,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:54:30,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:30,207 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-10-13 11:54:30,317 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-10-13 11:54:30,333 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 11:54:30,333 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-10-13 11:54:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:30,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:30,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:30,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781323139] [2024-10-13 11:54:30,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781323139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:30,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:30,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:54:30,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464121944] [2024-10-13 11:54:30,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:30,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:54:30,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:30,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:54:30,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-13 11:54:30,346 INFO L87 Difference]: Start difference. First operand 1371 states and 1943 transitions. Second operand has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 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-10-13 11:54:32,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:32,243 INFO L93 Difference]: Finished difference Result 1745 states and 2441 transitions. [2024-10-13 11:54:32,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:54:32,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 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 64 [2024-10-13 11:54:32,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:32,248 INFO L225 Difference]: With dead ends: 1745 [2024-10-13 11:54:32,249 INFO L226 Difference]: Without dead ends: 1745 [2024-10-13 11:54:32,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-13 11:54:32,249 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 693 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1194 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:32,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 964 Invalid, 2348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1134 Invalid, 0 Unknown, 1194 Unchecked, 1.8s Time] [2024-10-13 11:54:32,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2024-10-13 11:54:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1370. [2024-10-13 11:54:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 944 states have (on average 1.9915254237288136) internal successors, (1880), 1334 states have internal predecessors, (1880), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-10-13 11:54:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1941 transitions. [2024-10-13 11:54:32,276 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1941 transitions. Word has length 64 [2024-10-13 11:54:32,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:32,276 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1941 transitions. [2024-10-13 11:54:32,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 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-10-13 11:54:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1941 transitions. [2024-10-13 11:54:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 11:54:32,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:32,277 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] [2024-10-13 11:54:32,290 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-10-13 11:54:32,478 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-10-13 11:54:32,479 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:32,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:32,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1853468853, now seen corresponding path program 1 times [2024-10-13 11:54:32,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:32,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281447368] [2024-10-13 11:54:32,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:32,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:32,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:32,483 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-10-13 11:54:32,489 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-10-13 11:54:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:32,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 11:54:32,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:32,895 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-10-13 11:54:32,902 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-10-13 11:54:33,358 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-10-13 11:54:33,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:54:33,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:54:33,388 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:54:33,389 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-10-13 11:54:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:33,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:33,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:33,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281447368] [2024-10-13 11:54:33,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281447368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:33,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:33,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:54:33,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909943189] [2024-10-13 11:54:33,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:33,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:54:33,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:33,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:54:33,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-10-13 11:54:33,404 INFO L87 Difference]: Start difference. First operand 1370 states and 1941 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-10-13 11:54:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:37,434 INFO L93 Difference]: Finished difference Result 2329 states and 3258 transitions. [2024-10-13 11:54:37,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:54:37,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 64 [2024-10-13 11:54:37,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:37,441 INFO L225 Difference]: With dead ends: 2329 [2024-10-13 11:54:37,441 INFO L226 Difference]: Without dead ends: 2329 [2024-10-13 11:54:37,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-10-13 11:54:37,442 INFO L432 NwaCegarLoop]: 786 mSDtfsCounter, 852 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 4286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1628 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:37,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1665 Invalid, 4286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2635 Invalid, 0 Unknown, 1628 Unchecked, 3.9s Time] [2024-10-13 11:54:37,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2024-10-13 11:54:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1362. [2024-10-13 11:54:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 944 states have (on average 1.9745762711864407) internal successors, (1864), 1326 states have internal predecessors, (1864), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-10-13 11:54:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1925 transitions. [2024-10-13 11:54:37,484 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1925 transitions. Word has length 64 [2024-10-13 11:54:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:37,485 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1925 transitions. [2024-10-13 11:54:37,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-10-13 11:54:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1925 transitions. [2024-10-13 11:54:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 11:54:37,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:37,486 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] [2024-10-13 11:54:37,498 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 (20)] Forceful destruction successful, exit code 0 [2024-10-13 11:54:37,686 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-10-13 11:54:37,687 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:37,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1865756806, now seen corresponding path program 1 times [2024-10-13 11:54:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:37,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963074661] [2024-10-13 11:54:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:37,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:37,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:37,690 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-10-13 11:54:37,691 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-10-13 11:54:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:38,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 11:54:38,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:38,078 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-10-13 11:54:38,106 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-10-13 11:54:38,137 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-10-13 11:54:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:38,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:38,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:38,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963074661] [2024-10-13 11:54:38,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963074661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:38,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:38,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 11:54:38,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949733632] [2024-10-13 11:54:38,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:38,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:54:38,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:38,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:54:38,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:54:38,182 INFO L87 Difference]: Start difference. First operand 1362 states and 1925 transitions. Second operand has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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-10-13 11:54:41,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:41,369 INFO L93 Difference]: Finished difference Result 1373 states and 1937 transitions. [2024-10-13 11:54:41,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:54:41,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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 70 [2024-10-13 11:54:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:41,373 INFO L225 Difference]: With dead ends: 1373 [2024-10-13 11:54:41,373 INFO L226 Difference]: Without dead ends: 1373 [2024-10-13 11:54:41,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:54:41,374 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 12 mSDsluCounter, 2527 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3264 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:41,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3264 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 11:54:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-10-13 11:54:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1372. [2024-10-13 11:54:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 952 states have (on average 1.9705882352941178) internal successors, (1876), 1334 states have internal predecessors, (1876), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-10-13 11:54:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1937 transitions. [2024-10-13 11:54:41,397 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1937 transitions. Word has length 70 [2024-10-13 11:54:41,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:41,397 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1937 transitions. [2024-10-13 11:54:41,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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-10-13 11:54:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1937 transitions. [2024-10-13 11:54:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 11:54:41,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:41,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:41,409 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-10-13 11:54:41,602 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-10-13 11:54:41,603 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:41,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:41,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2003886214, now seen corresponding path program 1 times [2024-10-13 11:54:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:41,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876247065] [2024-10-13 11:54:41,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:41,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:41,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:41,605 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-10-13 11:54:41,606 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-10-13 11:54:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:41,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 11:54:41,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:41,931 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-10-13 11:54:41,963 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-10-13 11:54:41,967 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-10-13 11:54:42,001 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-10-13 11:54:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:42,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:42,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:42,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876247065] [2024-10-13 11:54:42,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876247065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:42,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:42,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 11:54:42,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98607944] [2024-10-13 11:54:42,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:42,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 11:54:42,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:42,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 11:54:42,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:54:42,088 INFO L87 Difference]: Start difference. First operand 1372 states and 1937 transitions. Second operand has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 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-10-13 11:54:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:45,935 INFO L93 Difference]: Finished difference Result 1372 states and 1935 transitions. [2024-10-13 11:54:45,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:54:45,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 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 71 [2024-10-13 11:54:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:45,937 INFO L225 Difference]: With dead ends: 1372 [2024-10-13 11:54:45,937 INFO L226 Difference]: Without dead ends: 1372 [2024-10-13 11:54:45,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 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-10-13 11:54:45,938 INFO L432 NwaCegarLoop]: 735 mSDtfsCounter, 11 mSDsluCounter, 3097 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3832 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:45,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3832 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2848 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-13 11:54:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-10-13 11:54:45,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2024-10-13 11:54:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 952 states have (on average 1.968487394957983) internal successors, (1874), 1334 states have internal predecessors, (1874), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-10-13 11:54:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1935 transitions. [2024-10-13 11:54:45,955 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1935 transitions. Word has length 71 [2024-10-13 11:54:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:45,955 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1935 transitions. [2024-10-13 11:54:45,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 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-10-13 11:54:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1935 transitions. [2024-10-13 11:54:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-13 11:54:45,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:45,956 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] [2024-10-13 11:54:45,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-13 11:54:46,157 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-10-13 11:54:46,157 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:46,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:46,157 INFO L85 PathProgramCache]: Analyzing trace with hash 894311914, now seen corresponding path program 1 times [2024-10-13 11:54:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:46,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495383783] [2024-10-13 11:54:46,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:46,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:46,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:46,159 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-10-13 11:54:46,161 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-10-13 11:54:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:46,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:54:46,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:46,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:46,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:46,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495383783] [2024-10-13 11:54:46,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495383783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:46,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:46,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:54:46,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8993691] [2024-10-13 11:54:46,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:46,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:54:46,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:46,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:54:46,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:54:46,530 INFO L87 Difference]: Start difference. First operand 1372 states and 1935 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-10-13 11:54:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:47,136 INFO L93 Difference]: Finished difference Result 1380 states and 1945 transitions. [2024-10-13 11:54:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:54:47,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 76 [2024-10-13 11:54:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:47,142 INFO L225 Difference]: With dead ends: 1380 [2024-10-13 11:54:47,142 INFO L226 Difference]: Without dead ends: 1378 [2024-10-13 11:54:47,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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-10-13 11:54:47,143 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 3 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:47,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2215 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:54:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-10-13 11:54:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2024-10-13 11:54:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 956 states have (on average 1.9665271966527196) internal successors, (1880), 1340 states have internal predecessors, (1880), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-10-13 11:54:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1943 transitions. [2024-10-13 11:54:47,163 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1943 transitions. Word has length 76 [2024-10-13 11:54:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:47,164 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1943 transitions. [2024-10-13 11:54:47,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-10-13 11:54:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1943 transitions. [2024-10-13 11:54:47,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 11:54:47,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:47,165 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] [2024-10-13 11:54:47,176 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 (23)] Forceful destruction successful, exit code 0 [2024-10-13 11:54:47,365 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-10-13 11:54:47,366 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:47,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash 886648934, now seen corresponding path program 1 times [2024-10-13 11:54:47,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:47,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415019953] [2024-10-13 11:54:47,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:47,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:47,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:47,370 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-10-13 11:54:47,370 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-10-13 11:54:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:47,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:54:47,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:47,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:54:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:47,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:47,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415019953] [2024-10-13 11:54:47,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415019953] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:54:47,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:54:47,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-13 11:54:47,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322387082] [2024-10-13 11:54:47,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:54:47,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:54:47,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:47,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:54:47,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:54:47,842 INFO L87 Difference]: Start difference. First operand 1378 states and 1943 transitions. Second operand has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 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-10-13 11:54:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:49,349 INFO L93 Difference]: Finished difference Result 1392 states and 1961 transitions. [2024-10-13 11:54:49,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 11:54:49,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 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 77 [2024-10-13 11:54:49,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:49,356 INFO L225 Difference]: With dead ends: 1392 [2024-10-13 11:54:49,356 INFO L226 Difference]: Without dead ends: 1388 [2024-10-13 11:54:49,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 144 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-10-13 11:54:49,357 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 13 mSDsluCounter, 4414 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5155 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:49,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5155 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 11:54:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-10-13 11:54:49,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1386. [2024-10-13 11:54:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 964 states have (on average 1.9605809128630705) internal successors, (1890), 1348 states have internal predecessors, (1890), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-10-13 11:54:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1953 transitions. [2024-10-13 11:54:49,375 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1953 transitions. Word has length 77 [2024-10-13 11:54:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:49,375 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1953 transitions. [2024-10-13 11:54:49,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 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-10-13 11:54:49,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1953 transitions. [2024-10-13 11:54:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-13 11:54:49,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:49,377 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] [2024-10-13 11:54:49,385 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-10-13 11:54:49,577 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-10-13 11:54:49,577 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:49,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1220336874, now seen corresponding path program 2 times [2024-10-13 11:54:49,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:49,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969836123] [2024-10-13 11:54:49,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:54:49,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:49,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:49,581 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-10-13 11:54:49,582 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-10-13 11:54:50,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:54:50,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:54:50,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 11:54:50,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:50,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:54:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:50,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:50,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969836123] [2024-10-13 11:54:50,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969836123] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:54:50,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:54:50,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-13 11:54:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565098677] [2024-10-13 11:54:50,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:54:50,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 11:54:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 11:54:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-13 11:54:50,454 INFO L87 Difference]: Start difference. First operand 1386 states and 1953 transitions. Second operand has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 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-10-13 11:54:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:52,682 INFO L93 Difference]: Finished difference Result 1410 states and 1991 transitions. [2024-10-13 11:54:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 11:54:52,684 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 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 80 [2024-10-13 11:54:52,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:52,686 INFO L225 Difference]: With dead ends: 1410 [2024-10-13 11:54:52,686 INFO L226 Difference]: Without dead ends: 1406 [2024-10-13 11:54:52,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-10-13 11:54:52,687 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 32 mSDsluCounter, 5890 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6631 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:52,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6631 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 11:54:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-10-13 11:54:52,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1404. [2024-10-13 11:54:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 982 states have (on average 1.9490835030549898) internal successors, (1914), 1366 states have internal predecessors, (1914), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-10-13 11:54:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1977 transitions. [2024-10-13 11:54:52,705 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1977 transitions. Word has length 80 [2024-10-13 11:54:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:52,706 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1977 transitions. [2024-10-13 11:54:52,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 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-10-13 11:54:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1977 transitions. [2024-10-13 11:54:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 11:54:52,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:52,711 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] [2024-10-13 11:54:52,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-10-13 11:54:52,912 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-10-13 11:54:52,912 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-13 11:54:52,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash 680455018, now seen corresponding path program 3 times [2024-10-13 11:54:52,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:52,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730738752] [2024-10-13 11:54:52,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 11:54:52,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:52,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:52,917 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-10-13 11:54:52,920 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-10-13 11:54:53,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 11:54:53,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:54:53,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 11:54:53,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:53,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:54:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:54,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:54,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730738752] [2024-10-13 11:54:54,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730738752] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:54:54,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:54:54,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-10-13 11:54:54,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749451760] [2024-10-13 11:54:54,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:54:54,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-13 11:54:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:54,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 11:54:54,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-10-13 11:54:54,579 INFO L87 Difference]: Start difference. First operand 1404 states and 1977 transitions. Second operand has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 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)