./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_SAX_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 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_SAX_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 ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:08:19,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:08:19,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 17:08:19,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:08:19,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:08:19,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:08:19,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:08:19,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:08:19,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:08:19,419 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:08:19,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:08:19,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:08:19,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:08:19,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:08:19,421 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:08:19,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:08:19,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:08:19,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:08:19,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:08:19,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:08:19,422 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:08:19,423 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:08:19,423 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:08:19,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:08:19,423 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:08:19,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:08:19,424 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:08:19,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:08:19,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:08:19,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:08:19,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:08:19,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:08:19,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:08:19,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:08:19,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:08:19,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:08:19,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:08:19,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:08:19,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:08:19,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:08:19,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:08:19,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:08:19,427 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 -> ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 [2024-11-20 17:08:19,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:08:19,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:08:19,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:08:19,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:08:19,625 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:08:19,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2024-11-20 17:08:20,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:08:21,169 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:08:21,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2024-11-20 17:08:21,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089232062/1bf89bba943e4155ac9f5ab07f312d93/FLAG76b178b33 [2024-11-20 17:08:21,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089232062/1bf89bba943e4155ac9f5ab07f312d93 [2024-11-20 17:08:21,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:08:21,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:08:21,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:08:21,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:08:21,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:08:21,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:08:21" (1/1) ... [2024-11-20 17:08:21,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@291e2f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:21, skipping insertion in model container [2024-11-20 17:08:21,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:08:21" (1/1) ... [2024-11-20 17:08:21,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:08:21,982 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,016 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,020 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,025 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,028 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,055 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,058 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,060 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,061 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,064 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,067 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,067 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,069 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,071 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:22,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:08:22,091 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-20 17:08:22,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7fcafdd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:22, skipping insertion in model container [2024-11-20 17:08:22,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:08:22,092 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-20 17:08:22,094 INFO L158 Benchmark]: Toolchain (without parser) took 582.61ms. Allocated memory is still 180.4MB. Free memory was 151.2MB in the beginning and 127.2MB in the end (delta: 24.0MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2024-11-20 17:08:22,094 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory was 95.8MB in the beginning and 95.7MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:08:22,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.95ms. Allocated memory is still 180.4MB. Free memory was 151.0MB in the beginning and 127.2MB in the end (delta: 23.7MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2024-11-20 17:08:22,096 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.13ms. Allocated memory is still 134.2MB. Free memory was 95.8MB in the beginning and 95.7MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.95ms. Allocated memory is still 180.4MB. Free memory was 151.0MB in the beginning and 127.2MB in the end (delta: 23.7MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_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 ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:08:23,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:08:23,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 17:08:23,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:08:23,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:08:23,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:08:23,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:08:23,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:08:23,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:08:23,749 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:08:23,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:08:23,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:08:23,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:08:23,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:08:23,753 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:08:23,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:08:23,753 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:08:23,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:08:23,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:08:23,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:08:23,754 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:08:23,754 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:08:23,754 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:08:23,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:08:23,755 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:08:23,757 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 17:08:23,757 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:08:23,757 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 17:08:23,757 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:08:23,757 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:08:23,757 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:08:23,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:08:23,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:08:23,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:08:23,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:08:23,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:08:23,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:08:23,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:08:23,758 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 17:08:23,759 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 17:08:23,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:08:23,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:08:23,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:08:23,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:08:23,760 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 -> ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 [2024-11-20 17:08:24,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:08:24,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:08:24,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:08:24,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:08:24,037 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:08:24,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2024-11-20 17:08:25,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:08:25,610 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:08:25,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2024-11-20 17:08:25,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef9fade9/21cdebb7b1bb4917b366d7944be747ce/FLAG285295ec1 [2024-11-20 17:08:25,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef9fade9/21cdebb7b1bb4917b366d7944be747ce [2024-11-20 17:08:25,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:08:25,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:08:25,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:08:25,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:08:25,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:08:25,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:08:25" (1/1) ... [2024-11-20 17:08:25,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1970f043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:25, skipping insertion in model container [2024-11-20 17:08:25,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:08:25" (1/1) ... [2024-11-20 17:08:25,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:08:26,409 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,439 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,442 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,447 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,457 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,491 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,493 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,495 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,498 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,500 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,501 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,501 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,505 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,507 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:08:26,528 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-20 17:08:26,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:08:26,573 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,588 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,593 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,595 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,599 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,615 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,615 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,617 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,617 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,619 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,620 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,624 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,625 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,627 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:08:26,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:08:26,638 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:08:26,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:08:26,750 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:08:26,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26 WrapperNode [2024-11-20 17:08:26,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:08:26,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:08:26,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:08:26,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:08:26,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26" (1/1) ... [2024-11-20 17:08:26,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26" (1/1) ... [2024-11-20 17:08:26,821 INFO L138 Inliner]: procedures = 286, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1078 [2024-11-20 17:08:26,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:08:26,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:08:26,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:08:26,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:08:26,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26" (1/1) ... [2024-11-20 17:08:26,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26" (1/1) ... [2024-11-20 17:08:26,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26" (1/1) ... [2024-11-20 17:08:26,925 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [220, 2, 12, 34]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [0, 2, 10, 0]. The 54 writes are split as follows [49, 0, 1, 4]. [2024-11-20 17:08:26,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26" (1/1) ... [2024-11-20 17:08:26,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26" (1/1) ... [2024-11-20 17:08:26,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26" (1/1) ... [2024-11-20 17:08:26,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26" (1/1) ... [2024-11-20 17:08:26,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26" (1/1) ... [2024-11-20 17:08:26,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26" (1/1) ... [2024-11-20 17:08:27,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:08:27,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:08:27,004 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:08:27,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:08:27,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26" (1/1) ... [2024-11-20 17:08:27,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:08:27,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:08:27,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 17:08:27,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 17:08:27,069 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-20 17:08:27,070 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-20 17:08:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 17:08:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 17:08:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 17:08:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-20 17:08:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 17:08:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 17:08:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 17:08:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-20 17:08:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 17:08:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 17:08:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 17:08:27,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 17:08:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-20 17:08:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 17:08:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 17:08:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 17:08:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 17:08:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-20 17:08:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 17:08:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 17:08:27,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 17:08:27,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 17:08:27,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-20 17:08:27,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-20 17:08:27,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-20 17:08:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-20 17:08:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-20 17:08:27,074 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-20 17:08:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 17:08:27,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 17:08:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 17:08:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:08:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-20 17:08:27,075 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-20 17:08:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 17:08:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 17:08:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 17:08:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-20 17:08:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-20 17:08:27,076 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-20 17:08:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:08:27,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:08:27,251 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:08:27,253 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:08:29,654 INFO L? ?]: Removed 1086 outVars from TransFormulas that were not future-live. [2024-11-20 17:08:29,655 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:08:29,698 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:08:29,701 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-20 17:08:29,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:08:29 BoogieIcfgContainer [2024-11-20 17:08:29,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:08:29,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:08:29,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:08:29,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:08:29,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:08:25" (1/3) ... [2024-11-20 17:08:29,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320022f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:08:29, skipping insertion in model container [2024-11-20 17:08:29,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:08:26" (2/3) ... [2024-11-20 17:08:29,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320022f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:08:29, skipping insertion in model container [2024-11-20 17:08:29,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:08:29" (3/3) ... [2024-11-20 17:08:29,709 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-1.i [2024-11-20 17:08:29,721 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:08:29,721 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 522 error locations. [2024-11-20 17:08:29,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:08:29,777 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;@9cff230, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:08:29,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 522 error locations. [2024-11-20 17:08:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 1085 states, 540 states have (on average 2.198148148148148) internal successors, (1187), 1065 states have internal predecessors, (1187), 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-11-20 17:08:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 17:08:29,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:29,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 17:08:29,786 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-11-20 17:08:29,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:29,789 INFO L85 PathProgramCache]: Analyzing trace with hash 85465, now seen corresponding path program 1 times [2024-11-20 17:08:29,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:29,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707485030] [2024-11-20 17:08:29,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:29,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:29,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:29,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:29,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 17:08:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:29,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:08:29,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:29,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:08:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:30,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:30,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:30,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707485030] [2024-11-20 17:08:30,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707485030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:30,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:30,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:08:30,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60335893] [2024-11-20 17:08:30,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:30,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:08:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:30,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:08:30,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:08:30,047 INFO L87 Difference]: Start difference. First operand has 1085 states, 540 states have (on average 2.198148148148148) internal successors, (1187), 1065 states have internal predecessors, (1187), 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.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:31,142 INFO L93 Difference]: Finished difference Result 1165 states and 1235 transitions. [2024-11-20 17:08:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:08:31,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-20 17:08:31,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:31,160 INFO L225 Difference]: With dead ends: 1165 [2024-11-20 17:08:31,160 INFO L226 Difference]: Without dead ends: 1163 [2024-11-20 17:08:31,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:08:31,164 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 720 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:31,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1042 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 17:08:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-20 17:08:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1106. [2024-11-20 17:08:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 576 states have (on average 2.0572916666666665) internal successors, (1185), 1088 states have internal predecessors, (1185), 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-11-20 17:08:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1215 transitions. [2024-11-20 17:08:31,226 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1215 transitions. Word has length 3 [2024-11-20 17:08:31,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:31,227 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1215 transitions. [2024-11-20 17:08:31,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:31,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1215 transitions. [2024-11-20 17:08:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 17:08:31,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:31,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 17:08:31,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 17:08:31,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:31,437 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-11-20 17:08:31,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:31,438 INFO L85 PathProgramCache]: Analyzing trace with hash 85466, now seen corresponding path program 1 times [2024-11-20 17:08:31,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:31,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490220736] [2024-11-20 17:08:31,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:31,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:31,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:31,440 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:31,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 17:08:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:31,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:08:31,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:31,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:08:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:31,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:31,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:31,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490220736] [2024-11-20 17:08:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490220736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:31,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:31,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:08:31,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437581591] [2024-11-20 17:08:31,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:31,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:08:31,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:31,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:08:31,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:08:31,562 INFO L87 Difference]: Start difference. First operand 1106 states and 1215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:33,080 INFO L93 Difference]: Finished difference Result 1510 states and 1656 transitions. [2024-11-20 17:08:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:08:33,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-20 17:08:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:33,085 INFO L225 Difference]: With dead ends: 1510 [2024-11-20 17:08:33,085 INFO L226 Difference]: Without dead ends: 1510 [2024-11-20 17:08:33,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:08:33,086 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 428 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:33,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1538 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 17:08:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-20 17:08:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1319. [2024-11-20 17:08:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 788 states have (on average 2.0431472081218276) internal successors, (1610), 1299 states have internal predecessors, (1610), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 17:08:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1644 transitions. [2024-11-20 17:08:33,117 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1644 transitions. Word has length 3 [2024-11-20 17:08:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:33,117 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1644 transitions. [2024-11-20 17:08:33,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1644 transitions. [2024-11-20 17:08:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 17:08:33,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:33,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:33,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 17:08:33,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:33,321 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-11-20 17:08:33,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:33,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1307350193, now seen corresponding path program 1 times [2024-11-20 17:08:33,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:33,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156758349] [2024-11-20 17:08:33,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:33,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:33,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:33,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:33,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 17:08:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:33,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 17:08:33,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:33,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:08:33,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:08:33,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 17:08:33,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 17:08:33,520 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 17:08:33,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-20 17:08:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:33,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:33,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:33,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156758349] [2024-11-20 17:08:33,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156758349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:33,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:33,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:08:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315758098] [2024-11-20 17:08:33,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:33,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:08:33,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:33,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:08:33,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:08:33,547 INFO L87 Difference]: Start difference. First operand 1319 states and 1644 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:36,128 INFO L93 Difference]: Finished difference Result 2025 states and 2408 transitions. [2024-11-20 17:08:36,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:08:36,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-20 17:08:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:36,133 INFO L225 Difference]: With dead ends: 2025 [2024-11-20 17:08:36,133 INFO L226 Difference]: Without dead ends: 2025 [2024-11-20 17:08:36,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:08:36,134 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 734 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:36,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1585 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1792 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-20 17:08:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2024-11-20 17:08:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1468. [2024-11-20 17:08:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 937 states have (on average 2.024546424759872) internal successors, (1897), 1448 states have internal predecessors, (1897), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 17:08:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1931 transitions. [2024-11-20 17:08:36,159 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1931 transitions. Word has length 8 [2024-11-20 17:08:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:36,159 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1931 transitions. [2024-11-20 17:08:36,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1931 transitions. [2024-11-20 17:08:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 17:08:36,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:36,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:36,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 17:08:36,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:36,361 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-11-20 17:08:36,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:36,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150296, now seen corresponding path program 1 times [2024-11-20 17:08:36,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:36,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2979115] [2024-11-20 17:08:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:36,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:36,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:36,365 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:36,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 17:08:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:36,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:08:36,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:36,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:08:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:36,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:36,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:36,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2979115] [2024-11-20 17:08:36,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2979115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:36,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:36,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:08:36,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772880490] [2024-11-20 17:08:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:36,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:08:36,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:36,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:08:36,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:08:36,487 INFO L87 Difference]: Start difference. First operand 1468 states and 1931 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:37,982 INFO L93 Difference]: Finished difference Result 2015 states and 2706 transitions. [2024-11-20 17:08:37,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:08:37,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 17:08:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:37,987 INFO L225 Difference]: With dead ends: 2015 [2024-11-20 17:08:37,987 INFO L226 Difference]: Without dead ends: 2015 [2024-11-20 17:08:37,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:08:37,988 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 924 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:37,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 2093 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 17:08:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-11-20 17:08:38,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1423. [2024-11-20 17:08:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 937 states have (on average 1.961579509071505) internal successors, (1838), 1403 states have internal predecessors, (1838), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 17:08:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1872 transitions. [2024-11-20 17:08:38,006 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1872 transitions. Word has length 9 [2024-11-20 17:08:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:38,007 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1872 transitions. [2024-11-20 17:08:38,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1872 transitions. [2024-11-20 17:08:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 17:08:38,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:38,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:38,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 17:08:38,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:38,210 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-11-20 17:08:38,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:38,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150295, now seen corresponding path program 1 times [2024-11-20 17:08:38,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:38,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371139130] [2024-11-20 17:08:38,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:38,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:38,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:38,213 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:38,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 17:08:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:38,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 17:08:38,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:38,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:08:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:38,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:38,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:38,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371139130] [2024-11-20 17:08:38,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371139130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:38,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:38,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:08:38,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533854888] [2024-11-20 17:08:38,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:38,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:08:38,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:38,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:08:38,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:08:38,340 INFO L87 Difference]: Start difference. First operand 1423 states and 1872 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:40,212 INFO L93 Difference]: Finished difference Result 2079 states and 2728 transitions. [2024-11-20 17:08:40,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:08:40,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 17:08:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:40,217 INFO L225 Difference]: With dead ends: 2079 [2024-11-20 17:08:40,217 INFO L226 Difference]: Without dead ends: 2079 [2024-11-20 17:08:40,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:08:40,218 INFO L432 NwaCegarLoop]: 1191 mSDtfsCounter, 704 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:40,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2448 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 17:08:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2024-11-20 17:08:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1415. [2024-11-20 17:08:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 939 states have (on average 1.933972310969116) internal successors, (1816), 1395 states have internal predecessors, (1816), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 17:08:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1850 transitions. [2024-11-20 17:08:40,236 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1850 transitions. Word has length 9 [2024-11-20 17:08:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:40,237 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 1850 transitions. [2024-11-20 17:08:40,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1850 transitions. [2024-11-20 17:08:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 17:08:40,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:40,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:40,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 17:08:40,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:40,441 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-11-20 17:08:40,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:40,441 INFO L85 PathProgramCache]: Analyzing trace with hash -325578228, now seen corresponding path program 1 times [2024-11-20 17:08:40,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:40,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232273102] [2024-11-20 17:08:40,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:40,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:40,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:40,444 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:40,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 17:08:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:40,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:08:40,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:40,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:40,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:40,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232273102] [2024-11-20 17:08:40,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232273102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:40,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:40,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:08:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260941505] [2024-11-20 17:08:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:40,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:08:40,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:40,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:08:40,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:08:40,600 INFO L87 Difference]: Start difference. First operand 1415 states and 1850 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:40,940 INFO L93 Difference]: Finished difference Result 1863 states and 2408 transitions. [2024-11-20 17:08:40,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:08:40,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 17:08:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:40,946 INFO L225 Difference]: With dead ends: 1863 [2024-11-20 17:08:40,946 INFO L226 Difference]: Without dead ends: 1863 [2024-11-20 17:08:40,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:08:40,948 INFO L432 NwaCegarLoop]: 1155 mSDtfsCounter, 455 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:40,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 3195 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 17:08:40,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2024-11-20 17:08:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1671. [2024-11-20 17:08:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1195 states have (on average 1.9489539748953975) internal successors, (2329), 1651 states have internal predecessors, (2329), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 17:08:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2363 transitions. [2024-11-20 17:08:40,972 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2363 transitions. Word has length 13 [2024-11-20 17:08:40,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:40,973 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2363 transitions. [2024-11-20 17:08:40,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2363 transitions. [2024-11-20 17:08:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 17:08:40,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:40,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:40,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-20 17:08:41,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:41,174 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-11-20 17:08:41,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:41,175 INFO L85 PathProgramCache]: Analyzing trace with hash -922136276, now seen corresponding path program 1 times [2024-11-20 17:08:41,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:41,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690098356] [2024-11-20 17:08:41,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:41,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:41,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:41,178 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:41,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 17:08:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:41,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:08:41,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:41,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:41,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:41,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690098356] [2024-11-20 17:08:41,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690098356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:41,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:41,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:08:41,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411359939] [2024-11-20 17:08:41,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:41,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:08:41,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:41,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:08:41,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:08:41,293 INFO L87 Difference]: Start difference. First operand 1671 states and 2363 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:41,317 INFO L93 Difference]: Finished difference Result 1575 states and 2191 transitions. [2024-11-20 17:08:41,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:08:41,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 17:08:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:41,323 INFO L225 Difference]: With dead ends: 1575 [2024-11-20 17:08:41,323 INFO L226 Difference]: Without dead ends: 1575 [2024-11-20 17:08:41,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:08:41,324 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 71 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:41,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1971 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:08:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-20 17:08:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2024-11-20 17:08:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1123 states have (on average 1.9207479964381122) internal successors, (2157), 1555 states have internal predecessors, (2157), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 17:08:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2191 transitions. [2024-11-20 17:08:41,344 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2191 transitions. Word has length 13 [2024-11-20 17:08:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:41,344 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2191 transitions. [2024-11-20 17:08:41,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2191 transitions. [2024-11-20 17:08:41,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 17:08:41,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:41,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:41,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-20 17:08:41,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:41,546 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-11-20 17:08:41,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:41,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1373575884, now seen corresponding path program 1 times [2024-11-20 17:08:41,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:41,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894771799] [2024-11-20 17:08:41,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:41,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:41,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:41,548 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:41,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 17:08:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:41,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:08:41,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:41,689 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 17:08:41,689 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 17:08:41,690 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 17:08:41,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-20 17:08:41,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 17:08:41,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-20 17:08:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:41,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:41,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:41,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894771799] [2024-11-20 17:08:41,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894771799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:41,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:41,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:08:41,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909172115] [2024-11-20 17:08:41,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:41,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:08:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:41,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:08:41,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:08:41,737 INFO L87 Difference]: Start difference. First operand 1575 states and 2191 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:41,977 INFO L93 Difference]: Finished difference Result 2100 states and 2505 transitions. [2024-11-20 17:08:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:08:41,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-20 17:08:41,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:41,982 INFO L225 Difference]: With dead ends: 2100 [2024-11-20 17:08:41,982 INFO L226 Difference]: Without dead ends: 2100 [2024-11-20 17:08:41,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:08:41,983 INFO L432 NwaCegarLoop]: 1004 mSDtfsCounter, 899 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:41,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 2985 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:08:41,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2024-11-20 17:08:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1240. [2024-11-20 17:08:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 790 states have (on average 1.9037974683544303) internal successors, (1504), 1222 states have internal predecessors, (1504), 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-11-20 17:08:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1534 transitions. [2024-11-20 17:08:41,998 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1534 transitions. Word has length 16 [2024-11-20 17:08:41,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:41,999 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1534 transitions. [2024-11-20 17:08:41,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:41,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1534 transitions. [2024-11-20 17:08:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 17:08:41,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:41,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:42,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-20 17:08:42,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:42,200 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-11-20 17:08:42,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1057218028, now seen corresponding path program 1 times [2024-11-20 17:08:42,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:42,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953154662] [2024-11-20 17:08:42,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:42,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:42,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:42,204 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:42,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 17:08:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:42,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:08:42,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:42,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:42,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:42,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953154662] [2024-11-20 17:08:42,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953154662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:42,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:42,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:08:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639348926] [2024-11-20 17:08:42,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:42,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:08:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:42,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:08:42,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:08:42,342 INFO L87 Difference]: Start difference. First operand 1240 states and 1534 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:42,364 INFO L93 Difference]: Finished difference Result 1180 states and 1448 transitions. [2024-11-20 17:08:42,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:08:42,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-20 17:08:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:42,367 INFO L225 Difference]: With dead ends: 1180 [2024-11-20 17:08:42,367 INFO L226 Difference]: Without dead ends: 1180 [2024-11-20 17:08:42,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:08:42,368 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 71 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:42,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1885 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:08:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-11-20 17:08:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2024-11-20 17:08:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 754 states have (on average 1.8806366047745358) internal successors, (1418), 1162 states have internal predecessors, (1418), 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-11-20 17:08:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1448 transitions. [2024-11-20 17:08:42,380 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1448 transitions. Word has length 19 [2024-11-20 17:08:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:42,381 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1448 transitions. [2024-11-20 17:08:42,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1448 transitions. [2024-11-20 17:08:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 17:08:42,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:42,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:42,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-20 17:08:42,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:42,583 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-11-20 17:08:42,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:42,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1920722190, now seen corresponding path program 1 times [2024-11-20 17:08:42,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:42,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437681255] [2024-11-20 17:08:42,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:42,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:42,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:42,585 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:42,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-20 17:08:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:42,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:08:42,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:42,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:42,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:42,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437681255] [2024-11-20 17:08:42,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437681255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:42,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:42,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:08:42,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905807331] [2024-11-20 17:08:42,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:42,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:08:42,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:42,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:08:42,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:08:42,736 INFO L87 Difference]: Start difference. First operand 1180 states and 1448 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:42,781 INFO L93 Difference]: Finished difference Result 1150 states and 1390 transitions. [2024-11-20 17:08:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:08:42,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-20 17:08:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:42,784 INFO L225 Difference]: With dead ends: 1150 [2024-11-20 17:08:42,784 INFO L226 Difference]: Without dead ends: 1150 [2024-11-20 17:08:42,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:08:42,784 INFO L432 NwaCegarLoop]: 929 mSDtfsCounter, 48 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:42,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2761 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:08:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-20 17:08:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2024-11-20 17:08:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 738 states have (on average 1.8428184281842819) internal successors, (1360), 1132 states have internal predecessors, (1360), 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-11-20 17:08:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1390 transitions. [2024-11-20 17:08:42,794 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1390 transitions. Word has length 21 [2024-11-20 17:08:42,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:42,795 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1390 transitions. [2024-11-20 17:08:42,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1390 transitions. [2024-11-20 17:08:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 17:08:42,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:42,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:42,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-20 17:08:42,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:42,996 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-11-20 17:08:42,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:42,997 INFO L85 PathProgramCache]: Analyzing trace with hash -956254243, now seen corresponding path program 1 times [2024-11-20 17:08:42,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:42,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592827389] [2024-11-20 17:08:42,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:42,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:42,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:43,000 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:43,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-20 17:08:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:43,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 17:08:43,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:43,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:08:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:43,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:43,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:43,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592827389] [2024-11-20 17:08:43,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592827389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:43,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:43,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:08:43,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187061679] [2024-11-20 17:08:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:43,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:08:43,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:43,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:08:43,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:08:43,316 INFO L87 Difference]: Start difference. First operand 1150 states and 1390 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:45,503 INFO L93 Difference]: Finished difference Result 1703 states and 2070 transitions. [2024-11-20 17:08:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:08:45,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-20 17:08:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:45,507 INFO L225 Difference]: With dead ends: 1703 [2024-11-20 17:08:45,507 INFO L226 Difference]: Without dead ends: 1703 [2024-11-20 17:08:45,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:08:45,508 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 594 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:45,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 3121 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-20 17:08:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-11-20 17:08:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1146. [2024-11-20 17:08:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 738 states have (on average 1.8319783197831978) internal successors, (1352), 1128 states have internal predecessors, (1352), 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-11-20 17:08:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1382 transitions. [2024-11-20 17:08:45,521 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1382 transitions. Word has length 35 [2024-11-20 17:08:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:45,522 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1382 transitions. [2024-11-20 17:08:45,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1382 transitions. [2024-11-20 17:08:45,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 17:08:45,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:45,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:45,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-20 17:08:45,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:45,728 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-11-20 17:08:45,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash -956254244, now seen corresponding path program 1 times [2024-11-20 17:08:45,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:45,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602836636] [2024-11-20 17:08:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:45,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:45,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:45,730 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:45,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-20 17:08:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:45,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:08:45,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:45,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:08:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:45,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:45,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:45,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602836636] [2024-11-20 17:08:45,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602836636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:45,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:45,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:08:45,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365514080] [2024-11-20 17:08:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:45,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:08:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:45,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:08:45,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:08:45,931 INFO L87 Difference]: Start difference. First operand 1146 states and 1382 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:47,308 INFO L93 Difference]: Finished difference Result 1572 states and 1929 transitions. [2024-11-20 17:08:47,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:08:47,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-20 17:08:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:47,311 INFO L225 Difference]: With dead ends: 1572 [2024-11-20 17:08:47,311 INFO L226 Difference]: Without dead ends: 1572 [2024-11-20 17:08:47,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:08:47,312 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 810 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:47,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1752 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 17:08:47,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-11-20 17:08:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1142. [2024-11-20 17:08:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 738 states have (on average 1.8211382113821137) internal successors, (1344), 1124 states have internal predecessors, (1344), 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-11-20 17:08:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1374 transitions. [2024-11-20 17:08:47,322 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1374 transitions. Word has length 35 [2024-11-20 17:08:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:47,323 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1374 transitions. [2024-11-20 17:08:47,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1374 transitions. [2024-11-20 17:08:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-20 17:08:47,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:47,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:47,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-20 17:08:47,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:47,525 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-11-20 17:08:47,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash 103689706, now seen corresponding path program 1 times [2024-11-20 17:08:47,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:47,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992965390] [2024-11-20 17:08:47,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:47,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-11-20 17:08:47,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:47,527 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:47,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-20 17:08:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:47,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:08:47,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:47,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:47,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:47,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992965390] [2024-11-20 17:08:47,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992965390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:47,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:47,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:08:47,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622302134] [2024-11-20 17:08:47,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:47,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:08:47,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:47,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:08:47,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:08:47,758 INFO L87 Difference]: Start difference. First operand 1142 states and 1374 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:47,801 INFO L93 Difference]: Finished difference Result 1130 states and 1354 transitions. [2024-11-20 17:08:47,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:08:47,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-20 17:08:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:47,804 INFO L225 Difference]: With dead ends: 1130 [2024-11-20 17:08:47,804 INFO L226 Difference]: Without dead ends: 1130 [2024-11-20 17:08:47,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:08:47,805 INFO L432 NwaCegarLoop]: 923 mSDtfsCounter, 21 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:47,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2738 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:08:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-11-20 17:08:47,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2024-11-20 17:08:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 726 states have (on average 1.8236914600550964) internal successors, (1324), 1112 states have internal predecessors, (1324), 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-11-20 17:08:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1354 transitions. [2024-11-20 17:08:47,818 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1354 transitions. Word has length 55 [2024-11-20 17:08:47,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:47,819 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1354 transitions. [2024-11-20 17:08:47,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1354 transitions. [2024-11-20 17:08:47,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-20 17:08:47,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:47,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:47,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-20 17:08:48,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:48,022 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-11-20 17:08:48,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash -636164170, now seen corresponding path program 1 times [2024-11-20 17:08:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:48,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616179574] [2024-11-20 17:08:48,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:48,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:48,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:48,025 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:48,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-20 17:08:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:48,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 17:08:48,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:48,324 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-20 17:08:48,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-20 17:08:48,372 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-20 17:08:48,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2024-11-20 17:08:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:48,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:48,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:48,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616179574] [2024-11-20 17:08:48,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616179574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:48,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:48,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:08:48,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754264715] [2024-11-20 17:08:48,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:48,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:08:48,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:48,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:08:48,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:08:48,642 INFO L87 Difference]: Start difference. First operand 1130 states and 1354 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:50,352 INFO L93 Difference]: Finished difference Result 2053 states and 2462 transitions. [2024-11-20 17:08:50,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:08:50,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-20 17:08:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:50,357 INFO L225 Difference]: With dead ends: 2053 [2024-11-20 17:08:50,357 INFO L226 Difference]: Without dead ends: 2053 [2024-11-20 17:08:50,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:08:50,358 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 793 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:50,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 2138 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 17:08:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2024-11-20 17:08:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1561. [2024-11-20 17:08:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1142 states have (on average 1.816987740805604) internal successors, (2075), 1531 states have internal predecessors, (2075), 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-11-20 17:08:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2129 transitions. [2024-11-20 17:08:50,373 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2129 transitions. Word has length 63 [2024-11-20 17:08:50,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:50,374 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2129 transitions. [2024-11-20 17:08:50,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2129 transitions. [2024-11-20 17:08:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-20 17:08:50,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:50,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:50,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-20 17:08:50,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:50,575 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-11-20 17:08:50,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:50,576 INFO L85 PathProgramCache]: Analyzing trace with hash -636164169, now seen corresponding path program 1 times [2024-11-20 17:08:50,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:50,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594525189] [2024-11-20 17:08:50,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:50,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:50,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:50,578 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:50,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-20 17:08:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:50,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 17:08:50,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:50,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 17:08:50,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 17:08:50,982 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 17:08:50,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-20 17:08:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:51,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:51,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:51,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594525189] [2024-11-20 17:08:51,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594525189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:51,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:51,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:08:51,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067627593] [2024-11-20 17:08:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:51,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:08:51,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:51,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:08:51,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:08:51,361 INFO L87 Difference]: Start difference. First operand 1561 states and 2129 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:52,641 INFO L93 Difference]: Finished difference Result 1566 states and 2135 transitions. [2024-11-20 17:08:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:08:52,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-20 17:08:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:52,648 INFO L225 Difference]: With dead ends: 1566 [2024-11-20 17:08:52,648 INFO L226 Difference]: Without dead ends: 1566 [2024-11-20 17:08:52,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:08:52,648 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 58 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:52,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1947 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 17:08:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-11-20 17:08:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2024-11-20 17:08:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1146 states have (on average 1.8141361256544504) internal successors, (2079), 1535 states have internal predecessors, (2079), 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-11-20 17:08:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2135 transitions. [2024-11-20 17:08:52,665 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2135 transitions. Word has length 63 [2024-11-20 17:08:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:52,665 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2135 transitions. [2024-11-20 17:08:52,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2135 transitions. [2024-11-20 17:08:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-20 17:08:52,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:52,667 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:52,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-20 17:08:52,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:52,868 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-20 17:08:52,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1657745720, now seen corresponding path program 1 times [2024-11-20 17:08:52,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:52,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832564699] [2024-11-20 17:08:52,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:52,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:52,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:52,870 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:52,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-20 17:08:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:53,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:08:53,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:53,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:53,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:53,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832564699] [2024-11-20 17:08:53,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832564699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:53,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:53,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:08:53,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999067939] [2024-11-20 17:08:53,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:53,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:08:53,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:53,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:08:53,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:08:53,104 INFO L87 Difference]: Start difference. First operand 1566 states and 2135 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:53,170 INFO L93 Difference]: Finished difference Result 1592 states and 2162 transitions. [2024-11-20 17:08:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:08:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-20 17:08:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:53,174 INFO L225 Difference]: With dead ends: 1592 [2024-11-20 17:08:53,174 INFO L226 Difference]: Without dead ends: 1592 [2024-11-20 17:08:53,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:08:53,175 INFO L432 NwaCegarLoop]: 933 mSDtfsCounter, 15 mSDsluCounter, 3727 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4660 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:53,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 4660 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:08:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-20 17:08:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1590. [2024-11-20 17:08:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1164 states have (on average 1.8058419243986255) internal successors, (2102), 1555 states have internal predecessors, (2102), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 17:08:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2162 transitions. [2024-11-20 17:08:53,192 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2162 transitions. Word has length 71 [2024-11-20 17:08:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:53,192 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 2162 transitions. [2024-11-20 17:08:53,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:08:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2162 transitions. [2024-11-20 17:08:53,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 17:08:53,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:53,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:53,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-20 17:08:53,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:53,393 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-20 17:08:53,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash 949549232, now seen corresponding path program 1 times [2024-11-20 17:08:53,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:53,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319409336] [2024-11-20 17:08:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:53,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:53,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:53,397 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:53,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-20 17:08:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:53,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:08:53,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:53,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:53,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:53,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319409336] [2024-11-20 17:08:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319409336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:53,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:53,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:08:53,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038335917] [2024-11-20 17:08:53,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:53,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:08:53,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:53,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:08:53,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:08:53,701 INFO L87 Difference]: Start difference. First operand 1590 states and 2162 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 17:08:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:53,846 INFO L93 Difference]: Finished difference Result 1602 states and 2176 transitions. [2024-11-20 17:08:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 17:08:53,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2024-11-20 17:08:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:53,851 INFO L225 Difference]: With dead ends: 1602 [2024-11-20 17:08:53,851 INFO L226 Difference]: Without dead ends: 1602 [2024-11-20 17:08:53,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:08:53,851 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 22 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:53,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4491 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:08:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2024-11-20 17:08:53,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1593. [2024-11-20 17:08:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1166 states have (on average 1.804459691252144) internal successors, (2104), 1557 states have internal predecessors, (2104), 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-11-20 17:08:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2165 transitions. [2024-11-20 17:08:53,866 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2165 transitions. Word has length 69 [2024-11-20 17:08:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:53,866 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2165 transitions. [2024-11-20 17:08:53,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 17:08:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2165 transitions. [2024-11-20 17:08:53,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 17:08:53,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:53,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:53,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-20 17:08:54,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:54,068 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-11-20 17:08:54,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:54,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1301141160, now seen corresponding path program 1 times [2024-11-20 17:08:54,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:54,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820651244] [2024-11-20 17:08:54,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:54,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:54,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:54,070 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:54,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-20 17:08:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:54,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 17:08:54,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:54,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:08:54,481 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-20 17:08:54,493 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-20 17:08:54,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-20 17:08:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:54,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:54,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:54,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820651244] [2024-11-20 17:08:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820651244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:54,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:54,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:08:54,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321571907] [2024-11-20 17:08:54,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:54,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:08:54,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:54,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:08:54,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-20 17:08:54,505 INFO L87 Difference]: Start difference. First operand 1593 states and 2165 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 17:08:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:56,102 INFO L93 Difference]: Finished difference Result 2014 states and 2710 transitions. [2024-11-20 17:08:56,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 17:08:56,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2024-11-20 17:08:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:56,109 INFO L225 Difference]: With dead ends: 2014 [2024-11-20 17:08:56,110 INFO L226 Difference]: Without dead ends: 2014 [2024-11-20 17:08:56,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-11-20 17:08:56,110 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 771 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 2956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1326 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:56,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1651 Invalid, 2956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1609 Invalid, 0 Unknown, 1326 Unchecked, 1.6s Time] [2024-11-20 17:08:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2024-11-20 17:08:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1592. [2024-11-20 17:08:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1166 states have (on average 1.8027444253859348) internal successors, (2102), 1556 states have internal predecessors, (2102), 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-11-20 17:08:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2163 transitions. [2024-11-20 17:08:56,131 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2163 transitions. Word has length 74 [2024-11-20 17:08:56,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:56,131 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2163 transitions. [2024-11-20 17:08:56,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 17:08:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2163 transitions. [2024-11-20 17:08:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 17:08:56,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:56,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:56,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-20 17:08:56,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:56,334 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-11-20 17:08:56,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:08:56,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1301141161, now seen corresponding path program 1 times [2024-11-20 17:08:56,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:08:56,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511959822] [2024-11-20 17:08:56,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:08:56,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:08:56,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:08:56,336 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:08:56,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-20 17:08:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:08:56,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 17:08:56,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:08:56,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:08:56,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:08:56,959 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2024-11-20 17:08:56,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 17:08:56,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 17:08:56,984 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 17:08:56,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-20 17:08:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:08:56,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:08:56,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:08:56,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511959822] [2024-11-20 17:08:56,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511959822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:08:56,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:08:56,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:08:56,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838586349] [2024-11-20 17:08:56,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:08:56,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:08:56,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:08:56,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:08:56,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-20 17:08:56,997 INFO L87 Difference]: Start difference. First operand 1592 states and 2163 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 17:08:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:08:59,954 INFO L93 Difference]: Finished difference Result 2690 states and 3619 transitions. [2024-11-20 17:08:59,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 17:08:59,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2024-11-20 17:08:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:08:59,958 INFO L225 Difference]: With dead ends: 2690 [2024-11-20 17:08:59,958 INFO L226 Difference]: Without dead ends: 2690 [2024-11-20 17:08:59,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-20 17:08:59,959 INFO L432 NwaCegarLoop]: 995 mSDtfsCounter, 1477 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2964 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 4800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1810 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-20 17:08:59,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 2410 Invalid, 4800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2964 Invalid, 0 Unknown, 1810 Unchecked, 2.9s Time] [2024-11-20 17:08:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-20 17:08:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 1584. [2024-11-20 17:08:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1166 states have (on average 1.7890222984562607) internal successors, (2086), 1548 states have internal predecessors, (2086), 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-11-20 17:08:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2147 transitions. [2024-11-20 17:08:59,975 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2147 transitions. Word has length 74 [2024-11-20 17:08:59,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:08:59,976 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2147 transitions. [2024-11-20 17:08:59,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 17:08:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2147 transitions. [2024-11-20 17:08:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 17:08:59,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:08:59,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:08:59,989 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-11-20 17:09:00,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:00,177 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-11-20 17:09:00,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:00,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2023437919, now seen corresponding path program 1 times [2024-11-20 17:09:00,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:09:00,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291892139] [2024-11-20 17:09:00,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:00,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:00,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:09:00,181 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:09:00,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-20 17:09:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:00,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 17:09:00,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:00,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:09:00,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:09:00,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 17:09:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:00,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:09:00,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:09:00,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291892139] [2024-11-20 17:09:00,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291892139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:00,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:00,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 17:09:00,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585616591] [2024-11-20 17:09:00,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:00,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 17:09:00,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:09:00,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 17:09:00,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:09:00,519 INFO L87 Difference]: Start difference. First operand 1584 states and 2147 transitions. Second operand has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 17:09:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:02,534 INFO L93 Difference]: Finished difference Result 1599 states and 2163 transitions. [2024-11-20 17:09:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:09:02,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-11-20 17:09:02,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:02,537 INFO L225 Difference]: With dead ends: 1599 [2024-11-20 17:09:02,537 INFO L226 Difference]: Without dead ends: 1599 [2024-11-20 17:09:02,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:09:02,537 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 16 mSDsluCounter, 3080 mSDsCounter, 0 mSdLazyCounter, 2495 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4000 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:02,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4000 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2495 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 17:09:02,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2024-11-20 17:09:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1598. [2024-11-20 17:09:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1178 states have (on average 1.7843803056027165) internal successors, (2102), 1560 states have internal predecessors, (2102), 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-11-20 17:09:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2163 transitions. [2024-11-20 17:09:02,551 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2163 transitions. Word has length 81 [2024-11-20 17:09:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:02,551 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2163 transitions. [2024-11-20 17:09:02,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 17:09:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2163 transitions. [2024-11-20 17:09:02,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-20 17:09:02,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:02,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:09:02,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-20 17:09:02,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:02,757 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-11-20 17:09:02,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1697934027, now seen corresponding path program 1 times [2024-11-20 17:09:02,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:09:02,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918307426] [2024-11-20 17:09:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:02,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:02,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:09:02,761 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:09:02,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-20 17:09:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:03,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 17:09:03,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:03,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:09:03,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:09:03,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 17:09:03,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-20 17:09:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:03,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:09:03,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:09:03,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918307426] [2024-11-20 17:09:03,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918307426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:03,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:03,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 17:09:03,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701051162] [2024-11-20 17:09:03,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:03,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 17:09:03,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:09:03,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 17:09:03,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 17:09:03,123 INFO L87 Difference]: Start difference. First operand 1598 states and 2163 transitions. Second operand has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 17:09:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:05,710 INFO L93 Difference]: Finished difference Result 1598 states and 2161 transitions. [2024-11-20 17:09:05,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:09:05,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2024-11-20 17:09:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:05,712 INFO L225 Difference]: With dead ends: 1598 [2024-11-20 17:09:05,712 INFO L226 Difference]: Without dead ends: 1598 [2024-11-20 17:09:05,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-20 17:09:05,713 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 13 mSDsluCounter, 3837 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:05,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4753 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-20 17:09:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2024-11-20 17:09:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2024-11-20 17:09:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1178 states have (on average 1.7826825127334465) internal successors, (2100), 1560 states have internal predecessors, (2100), 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-11-20 17:09:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2161 transitions. [2024-11-20 17:09:05,732 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2161 transitions. Word has length 82 [2024-11-20 17:09:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:05,732 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2161 transitions. [2024-11-20 17:09:05,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 17:09:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2161 transitions. [2024-11-20 17:09:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 17:09:05,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:05,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:09:05,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-20 17:09:05,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:05,933 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-11-20 17:09:05,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1028513902, now seen corresponding path program 1 times [2024-11-20 17:09:05,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:09:05,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124030280] [2024-11-20 17:09:05,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:05,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:05,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:09:05,935 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:09:05,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-20 17:09:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:06,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:09:06,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:06,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:09:06,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:09:06,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124030280] [2024-11-20 17:09:06,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124030280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:09:06,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:09:06,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:09:06,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086937681] [2024-11-20 17:09:06,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:09:06,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:09:06,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:09:06,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:09:06,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:09:06,208 INFO L87 Difference]: Start difference. First operand 1598 states and 2161 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 17:09:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:06,243 INFO L93 Difference]: Finished difference Result 1614 states and 2179 transitions. [2024-11-20 17:09:06,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:09:06,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 89 [2024-11-20 17:09:06,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:06,246 INFO L225 Difference]: With dead ends: 1614 [2024-11-20 17:09:06,246 INFO L226 Difference]: Without dead ends: 1608 [2024-11-20 17:09:06,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:09:06,247 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 3 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:06,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3684 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:09:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-11-20 17:09:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2024-11-20 17:09:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1186 states have (on average 1.779089376053963) internal successors, (2110), 1570 states have internal predecessors, (2110), 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-11-20 17:09:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2173 transitions. [2024-11-20 17:09:06,271 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2173 transitions. Word has length 89 [2024-11-20 17:09:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:06,272 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2173 transitions. [2024-11-20 17:09:06,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 17:09:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2173 transitions. [2024-11-20 17:09:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-20 17:09:06,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:06,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:09:06,284 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-11-20 17:09:06,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:06,473 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-11-20 17:09:06,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:06,474 INFO L85 PathProgramCache]: Analyzing trace with hash -659854572, now seen corresponding path program 1 times [2024-11-20 17:09:06,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:09:06,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340266266] [2024-11-20 17:09:06,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:09:06,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:06,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:09:06,477 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:09:06,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-20 17:09:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:09:06,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:09:06,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:06,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:09:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:06,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:09:06,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340266266] [2024-11-20 17:09:06,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340266266] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:09:06,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:09:06,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-20 17:09:06,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854290370] [2024-11-20 17:09:06,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:09:06,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:09:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:09:06,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:09:06,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:09:06,877 INFO L87 Difference]: Start difference. First operand 1608 states and 2173 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 17:09:06,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:06,992 INFO L93 Difference]: Finished difference Result 1634 states and 2203 transitions. [2024-11-20 17:09:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 17:09:06,992 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 90 [2024-11-20 17:09:06,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:06,994 INFO L225 Difference]: With dead ends: 1634 [2024-11-20 17:09:06,994 INFO L226 Difference]: Without dead ends: 1622 [2024-11-20 17:09:06,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-20 17:09:06,995 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 21 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3688 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:06,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3688 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:09:06,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-11-20 17:09:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1616. [2024-11-20 17:09:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1194 states have (on average 1.7755443886097153) internal successors, (2120), 1578 states have internal predecessors, (2120), 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-11-20 17:09:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2183 transitions. [2024-11-20 17:09:07,010 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2183 transitions. Word has length 90 [2024-11-20 17:09:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:07,010 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2183 transitions. [2024-11-20 17:09:07,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 17:09:07,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2183 transitions. [2024-11-20 17:09:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-20 17:09:07,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:07,011 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:09:07,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-20 17:09:07,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:07,212 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-11-20 17:09:07,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash -307340818, now seen corresponding path program 2 times [2024-11-20 17:09:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:09:07,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618652456] [2024-11-20 17:09:07,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:09:07,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:07,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:09:07,214 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:09:07,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-20 17:09:07,724 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 17:09:07,724 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:09:07,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 17:09:07,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:07,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:09:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:07,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:09:07,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618652456] [2024-11-20 17:09:07,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618652456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:09:07,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:09:07,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-20 17:09:07,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72241768] [2024-11-20 17:09:07,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:09:07,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 17:09:07,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:09:07,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 17:09:07,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-20 17:09:07,948 INFO L87 Difference]: Start difference. First operand 1616 states and 2183 transitions. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 17:09:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:08,319 INFO L93 Difference]: Finished difference Result 1652 states and 2233 transitions. [2024-11-20 17:09:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 17:09:08,320 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 93 [2024-11-20 17:09:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:08,322 INFO L225 Difference]: With dead ends: 1652 [2024-11-20 17:09:08,322 INFO L226 Difference]: Without dead ends: 1640 [2024-11-20 17:09:08,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-20 17:09:08,323 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 36 mSDsluCounter, 7361 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 8286 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:08,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 8286 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:09:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-20 17:09:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1634. [2024-11-20 17:09:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1212 states have (on average 1.768976897689769) internal successors, (2144), 1596 states have internal predecessors, (2144), 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-11-20 17:09:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2207 transitions. [2024-11-20 17:09:08,351 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2207 transitions. Word has length 93 [2024-11-20 17:09:08,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:08,353 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2207 transitions. [2024-11-20 17:09:08,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 17:09:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2207 transitions. [2024-11-20 17:09:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 17:09:08,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:08,354 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:09:08,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-20 17:09:08,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:08,554 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-11-20 17:09:08,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:08,555 INFO L85 PathProgramCache]: Analyzing trace with hash -257513426, now seen corresponding path program 3 times [2024-11-20 17:09:08,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:09:08,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476668910] [2024-11-20 17:09:08,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 17:09:08,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:08,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:09:08,558 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:09:08,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-20 17:09:09,273 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-20 17:09:09,274 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:09:09,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 17:09:09,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:09,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:09:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:09,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:09:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476668910] [2024-11-20 17:09:09,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476668910] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:09:09,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:09:09,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-20 17:09:09,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456849555] [2024-11-20 17:09:09,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:09:09,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-20 17:09:09,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:09:09,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-20 17:09:09,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-11-20 17:09:09,891 INFO L87 Difference]: Start difference. First operand 1634 states and 2207 transitions. Second operand has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 17:09:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:11,330 INFO L93 Difference]: Finished difference Result 1688 states and 2291 transitions. [2024-11-20 17:09:11,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-20 17:09:11,331 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 99 [2024-11-20 17:09:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:11,333 INFO L225 Difference]: With dead ends: 1688 [2024-11-20 17:09:11,333 INFO L226 Difference]: Without dead ends: 1670 [2024-11-20 17:09:11,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-11-20 17:09:11,334 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 43 mSDsluCounter, 11960 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 12885 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:11,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 12885 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 17:09:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2024-11-20 17:09:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2024-11-20 17:09:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1248 states have (on average 1.7548076923076923) internal successors, (2190), 1632 states have internal predecessors, (2190), 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-11-20 17:09:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2253 transitions. [2024-11-20 17:09:11,349 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2253 transitions. Word has length 99 [2024-11-20 17:09:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:11,349 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2253 transitions. [2024-11-20 17:09:11,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 17:09:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2253 transitions. [2024-11-20 17:09:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 17:09:11,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:11,350 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:09:11,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-20 17:09:11,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:11,552 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-20 17:09:11,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:11,552 INFO L85 PathProgramCache]: Analyzing trace with hash 351286446, now seen corresponding path program 4 times [2024-11-20 17:09:11,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:09:11,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852543592] [2024-11-20 17:09:11,553 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 17:09:11,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:11,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:09:11,554 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:09:11,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-20 17:09:12,089 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 17:09:12,089 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:09:12,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 17:09:12,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:12,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:09:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:09:13,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:09:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852543592] [2024-11-20 17:09:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852543592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:09:13,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:09:13,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-20 17:09:13,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519788588] [2024-11-20 17:09:13,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:09:13,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-20 17:09:13,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:09:13,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-20 17:09:13,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2024-11-20 17:09:13,625 INFO L87 Difference]: Start difference. First operand 1670 states and 2253 transitions. Second operand has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 17:09:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:09:20,414 INFO L93 Difference]: Finished difference Result 1756 states and 2403 transitions. [2024-11-20 17:09:20,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-20 17:09:20,415 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 111 [2024-11-20 17:09:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:09:20,417 INFO L225 Difference]: With dead ends: 1756 [2024-11-20 17:09:20,417 INFO L226 Difference]: Without dead ends: 1744 [2024-11-20 17:09:20,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2024-11-20 17:09:20,419 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 101 mSDsluCounter, 22101 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 23026 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 17:09:20,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 23026 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 17:09:20,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2024-11-20 17:09:20,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1738. [2024-11-20 17:09:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1316 states have (on average 1.7340425531914894) internal successors, (2282), 1700 states have internal predecessors, (2282), 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-11-20 17:09:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2345 transitions. [2024-11-20 17:09:20,442 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2345 transitions. Word has length 111 [2024-11-20 17:09:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:09:20,442 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2345 transitions. [2024-11-20 17:09:20,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 17:09:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2345 transitions. [2024-11-20 17:09:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-20 17:09:20,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:09:20,443 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:09:20,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-20 17:09:20,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:20,644 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-20 17:09:20,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:09:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2042747118, now seen corresponding path program 5 times [2024-11-20 17:09:20,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:09:20,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707705205] [2024-11-20 17:09:20,646 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 17:09:20,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:09:20,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:09:20,648 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:09:20,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-20 17:09:21,666 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-20 17:09:21,666 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:09:21,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-20 17:09:21,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:09:21,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:09:21,817 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-20 17:09:21,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-20 17:09:21,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:09:21,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-20 17:09:22,743 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:09:22,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-20 17:09:22,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-20 17:09:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2024-11-20 17:09:22,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:09:23,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:09:23,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707705205] [2024-11-20 17:09:23,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707705205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:09:23,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [844569745] [2024-11-20 17:09:23,070 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 17:09:23,070 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 17:09:23,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 17:09:23,071 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 17:09:23,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process